./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b 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/complex_data_creation_test02-2.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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:39:02,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:39:02,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:39:02,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:39:02,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:39:02,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:39:02,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:39:02,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:39:02,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:39:02,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:39:02,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:39:02,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:39:02,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:39:02,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:39:02,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:39:02,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:39:02,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:39:02,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:39:02,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:39:02,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:39:02,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:39:02,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:39:02,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:39:02,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:39:02,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:39:02,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:39:02,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:39:02,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:39:02,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:39:02,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:39:02,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:39:02,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:39:02,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:39:02,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:39:02,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:39:02,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:39:02,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:39:02,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:39:02,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:39:02,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:39:02,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:39:02,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:39:02,837 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:39:02,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:39:02,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:39:02,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:39:02,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:39:02,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:39:02,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:39:02,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:39:02,840 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:39:02,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:39:02,841 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:39:02,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:39:02,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:39:02,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:39:02,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:39:02,842 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:39:02,842 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:39:02,842 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:39:02,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:39:02,843 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:39:02,843 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:39:02,843 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:39:02,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:39:02,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:39:02,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:39:02,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:02,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:39:02,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:39:02,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:39:02,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:39:02,845 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:39:02,845 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2021-12-14 19:39:03,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:39:03,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:39:03,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:39:03,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:39:03,083 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:39:03,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2021-12-14 19:39:03,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cf09ad7/5ea5039b9b4d4c36b5ae5ee3fe84b320/FLAG3253271bd [2021-12-14 19:39:03,590 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:39:03,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2021-12-14 19:39:03,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cf09ad7/5ea5039b9b4d4c36b5ae5ee3fe84b320/FLAG3253271bd [2021-12-14 19:39:03,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cf09ad7/5ea5039b9b4d4c36b5ae5ee3fe84b320 [2021-12-14 19:39:03,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:39:03,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:39:03,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:03,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:39:03,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:39:03,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:03" (1/1) ... [2021-12-14 19:39:03,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71eed417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:03, skipping insertion in model container [2021-12-14 19:39:03,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:03" (1/1) ... [2021-12-14 19:39:03,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:39:04,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:04,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:04,245 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-14 19:39:04,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@247f7cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:04, skipping insertion in model container [2021-12-14 19:39:04,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:04,247 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-14 19:39:04,249 INFO L158 Benchmark]: Toolchain (without parser) took 286.28ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 48.7MB in the beginning and 73.9MB in the end (delta: -25.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:39:04,249 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:39:04,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.22ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 48.4MB in the beginning and 73.9MB in the end (delta: -25.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:39:04,251 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.22ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 48.4MB in the beginning and 73.9MB in the end (delta: -25.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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/complex_data_creation_test02-2.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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:39:05,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:39:05,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:39:06,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:39:06,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:39:06,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:39:06,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:39:06,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:39:06,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:39:06,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:39:06,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:39:06,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:39:06,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:39:06,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:39:06,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:39:06,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:39:06,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:39:06,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:39:06,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:39:06,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:39:06,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:39:06,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:39:06,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:39:06,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:39:06,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:39:06,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:39:06,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:39:06,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:39:06,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:39:06,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:39:06,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:39:06,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:39:06,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:39:06,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:39:06,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:39:06,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:39:06,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:39:06,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:39:06,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:39:06,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:39:06,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:39:06,065 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:39:06,101 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:39:06,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:39:06,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:39:06,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:39:06,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:39:06,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:39:06,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:39:06,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:39:06,105 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:39:06,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:39:06,106 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:39:06,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:39:06,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:39:06,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:39:06,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:39:06,107 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:39:06,108 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:39:06,108 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:39:06,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:39:06,108 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:39:06,108 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:39:06,108 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:39:06,109 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:39:06,109 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:39:06,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:39:06,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:39:06,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:39:06,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:06,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:39:06,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:39:06,110 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:39:06,110 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:06,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:39:06,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:39:06,111 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2021-12-14 19:39:06,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:39:06,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:39:06,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:39:06,444 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:39:06,447 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:39:06,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2021-12-14 19:39:06,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0537d18/ea24f2a64ad24e9c96f9f7db0b64a61b/FLAG667117236 [2021-12-14 19:39:06,941 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:39:06,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2021-12-14 19:39:06,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0537d18/ea24f2a64ad24e9c96f9f7db0b64a61b/FLAG667117236 [2021-12-14 19:39:06,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d0537d18/ea24f2a64ad24e9c96f9f7db0b64a61b [2021-12-14 19:39:06,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:39:06,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:39:06,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:06,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:39:06,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:39:06,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:06" (1/1) ... [2021-12-14 19:39:06,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a8647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:06, skipping insertion in model container [2021-12-14 19:39:06,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:06" (1/1) ... [2021-12-14 19:39:06,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:39:07,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:07,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:07,310 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-14 19:39:07,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:07,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:07,367 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:39:07,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:07,454 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:39:07,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07 WrapperNode [2021-12-14 19:39:07,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:07,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:07,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:39:07,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:39:07,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,528 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2021-12-14 19:39:07,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:07,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:39:07,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:39:07,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:39:07,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:39:07,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:39:07,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:39:07,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:39:07,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (1/1) ... [2021-12-14 19:39:07,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:07,617 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-14 19:39:07,638 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-14 19:39:07,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:39:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:39:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2021-12-14 19:39:07,651 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2021-12-14 19:39:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:39:07,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:39:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:39:07,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:39:07,815 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:39:07,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:39:08,552 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:39:08,558 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:39:08,559 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 19:39:08,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:08 BoogieIcfgContainer [2021-12-14 19:39:08,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:39:08,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:39:08,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:39:08,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:39:08,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:39:06" (1/3) ... [2021-12-14 19:39:08,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f1ad84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:08, skipping insertion in model container [2021-12-14 19:39:08,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:07" (2/3) ... [2021-12-14 19:39:08,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f1ad84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:08, skipping insertion in model container [2021-12-14 19:39:08,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:08" (3/3) ... [2021-12-14 19:39:08,566 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2021-12-14 19:39:08,570 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:39:08,571 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2021-12-14 19:39:08,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:39:08,608 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-14 19:39:08,609 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2021-12-14 19:39:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:08,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:08,635 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2021-12-14 19:39:08,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522580215] [2021-12-14 19:39:08,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,651 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:08,653 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-14 19:39:08,656 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-14 19:39:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,752 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-14 19:39:08,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522580215] [2021-12-14 19:39:08,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522580215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:08,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133842342] [2021-12-14 19:39:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 19:39:08,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 19:39:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:39:08,782 INFO L87 Difference]: Start difference. First operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-14 19:39:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:08,807 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2021-12-14 19:39:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:39:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-14 19:39:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:08,816 INFO L225 Difference]: With dead ends: 189 [2021-12-14 19:39:08,816 INFO L226 Difference]: Without dead ends: 187 [2021-12-14 19:39:08,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:39:08,820 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:08,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-14 19:39:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-12-14 19:39:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2021-12-14 19:39:08,869 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2021-12-14 19:39:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:08,870 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2021-12-14 19:39:08,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-14 19:39:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2021-12-14 19:39:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:08,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:08,880 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-14 19:39:09,078 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-14 19:39:09,079 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2021-12-14 19:39:09,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225239060] [2021-12-14 19:39:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:09,080 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,083 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-14 19:39:09,085 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-14 19:39:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:09,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:09,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:09,186 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-14 19:39:09,253 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:09,254 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 16 treesize of output 21 [2021-12-14 19:39:09,282 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-14 19:39:09,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:09,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:09,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225239060] [2021-12-14 19:39:09,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225239060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:09,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:09,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:09,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181942930] [2021-12-14 19:39:09,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:09,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:09,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:09,296 INFO L87 Difference]: Start difference. First operand 187 states and 198 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-14 19:39:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:09,673 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2021-12-14 19:39:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:09,675 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-14 19:39:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:09,677 INFO L225 Difference]: With dead ends: 182 [2021-12-14 19:39:09,677 INFO L226 Difference]: Without dead ends: 182 [2021-12-14 19:39:09,678 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-14 19:39:09,679 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 47 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:09,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 331 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2021-12-14 19:39:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-14 19:39:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-14 19:39:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 92 states have (on average 2.0543478260869565) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2021-12-14 19:39:09,699 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 4 [2021-12-14 19:39:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:09,700 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2021-12-14 19:39:09,700 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-14 19:39:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2021-12-14 19:39:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:09,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:09,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:09,715 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-14 19:39:09,909 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-14 19:39:09,910 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2021-12-14 19:39:09,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:09,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467344558] [2021-12-14 19:39:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:09,911 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:09,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,912 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-14 19:39:09,914 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-14 19:39:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:09,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:09,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:09,988 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-14 19:39:09,994 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-14 19:39:10,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:10,058 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-14 19:39:10,068 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:10,069 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 17 treesize of output 17 [2021-12-14 19:39:10,091 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-14 19:39:10,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:10,092 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:10,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467344558] [2021-12-14 19:39:10,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467344558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:10,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:10,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:10,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249377979] [2021-12-14 19:39:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:10,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:10,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:10,094 INFO L87 Difference]: Start difference. First operand 182 states and 193 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-14 19:39:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:10,665 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2021-12-14 19:39:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:10,666 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-14 19:39:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:10,669 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:39:10,669 INFO L226 Difference]: Without dead ends: 199 [2021-12-14 19:39:10,669 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-14 19:39:10,670 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 30 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:10,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 344 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:39:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-14 19:39:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2021-12-14 19:39:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 97 states have (on average 2.0309278350515463) internal successors, (197), 183 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2021-12-14 19:39:10,689 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 4 [2021-12-14 19:39:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:10,690 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2021-12-14 19:39:10,690 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-14 19:39:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2021-12-14 19:39:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:10,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:10,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:10,698 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-14 19:39:10,898 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-14 19:39:10,899 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2021-12-14 19:39:10,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:10,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550277834] [2021-12-14 19:39:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:10,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:10,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:10,912 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-14 19:39:10,914 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-14 19:39:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:10,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:10,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:10,982 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-14 19:39:10,991 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-14 19:39:10,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:10,991 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:10,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550277834] [2021-12-14 19:39:10,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550277834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:10,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:10,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:10,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009097757] [2021-12-14 19:39:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:10,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:10,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:10,996 INFO L87 Difference]: Start difference. First operand 187 states and 201 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-14 19:39:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:11,253 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2021-12-14 19:39:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:11,254 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-14 19:39:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:11,255 INFO L225 Difference]: With dead ends: 210 [2021-12-14 19:39:11,255 INFO L226 Difference]: Without dead ends: 210 [2021-12-14 19:39:11,255 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-14 19:39:11,256 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 65 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:11,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 232 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-14 19:39:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 185. [2021-12-14 19:39:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 97 states have (on average 2.0) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2021-12-14 19:39:11,264 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 5 [2021-12-14 19:39:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:11,265 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2021-12-14 19:39:11,265 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-14 19:39:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2021-12-14 19:39:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:11,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:11,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:11,278 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-14 19:39:11,474 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-14 19:39:11,475 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2021-12-14 19:39:11,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512986477] [2021-12-14 19:39:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:11,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:11,477 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-14 19:39:11,478 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-14 19:39:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:11,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:11,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:11,546 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-14 19:39:11,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-14 19:39:11,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:11,572 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:11,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512986477] [2021-12-14 19:39:11,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512986477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:11,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:11,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:11,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050575126] [2021-12-14 19:39:11,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:11,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:11,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:11,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:11,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:11,574 INFO L87 Difference]: Start difference. First operand 185 states and 198 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-14 19:39:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:11,840 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2021-12-14 19:39:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:11,846 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-14 19:39:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:11,847 INFO L225 Difference]: With dead ends: 183 [2021-12-14 19:39:11,847 INFO L226 Difference]: Without dead ends: 183 [2021-12-14 19:39:11,847 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-14 19:39:11,853 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 12 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:11,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 274 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-14 19:39:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-12-14 19:39:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 97 states have (on average 1.9690721649484537) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2021-12-14 19:39:11,869 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2021-12-14 19:39:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:11,870 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2021-12-14 19:39:11,870 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-14 19:39:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2021-12-14 19:39:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:39:11,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:11,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:11,881 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-14 19:39:12,079 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-14 19:39:12,080 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash 141453102, now seen corresponding path program 1 times [2021-12-14 19:39:12,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173555028] [2021-12-14 19:39:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:12,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:12,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:12,082 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-14 19:39:12,083 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-14 19:39:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:12,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:12,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:12,159 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-14 19:39:12,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:12,160 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:12,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173555028] [2021-12-14 19:39:12,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173555028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:12,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:12,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:12,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719291334] [2021-12-14 19:39:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:12,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:12,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:12,163 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-14 19:39:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:12,366 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2021-12-14 19:39:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2021-12-14 19:39:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:12,367 INFO L225 Difference]: With dead ends: 207 [2021-12-14 19:39:12,367 INFO L226 Difference]: Without dead ends: 207 [2021-12-14 19:39:12,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 19:39:12,368 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 54 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:12,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 238 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-14 19:39:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 182. [2021-12-14 19:39:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2021-12-14 19:39:12,374 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 7 [2021-12-14 19:39:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:12,375 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2021-12-14 19:39:12,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-14 19:39:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2021-12-14 19:39:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:39:12,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:12,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:12,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-14 19:39:12,584 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-14 19:39:12,584 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2021-12-14 19:39:12,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:12,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039408439] [2021-12-14 19:39:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:12,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:12,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:12,586 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-14 19:39:12,587 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-14 19:39:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:12,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:12,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:12,670 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-14 19:39:12,736 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:12,737 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 16 treesize of output 16 [2021-12-14 19:39:12,802 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 14 treesize of output 16 [2021-12-14 19:39:12,810 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 14 treesize of output 16 [2021-12-14 19:39:12,842 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-14 19:39:12,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 15 treesize of output 7 [2021-12-14 19:39:12,872 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-14 19:39:12,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:12,872 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:12,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039408439] [2021-12-14 19:39:12,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039408439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:12,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:12,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:12,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416126571] [2021-12-14 19:39:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:12,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:12,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:12,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:12,875 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 19:39:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:13,301 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2021-12-14 19:39:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2021-12-14 19:39:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:13,303 INFO L225 Difference]: With dead ends: 184 [2021-12-14 19:39:13,303 INFO L226 Difference]: Without dead ends: 184 [2021-12-14 19:39:13,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:13,303 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 5 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:13,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 606 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-14 19:39:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2021-12-14 19:39:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2021-12-14 19:39:13,308 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2021-12-14 19:39:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:13,309 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2021-12-14 19:39:13,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 19:39:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2021-12-14 19:39:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:39:13,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:13,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:13,322 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-14 19:39:13,518 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-14 19:39:13,519 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2021-12-14 19:39:13,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:13,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716463208] [2021-12-14 19:39:13,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:13,520 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:13,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:13,521 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-14 19:39:13,522 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-14 19:39:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:13,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:39:13,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:13,621 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-14 19:39:13,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:13,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716463208] [2021-12-14 19:39:13,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716463208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:13,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:13,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:13,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841348405] [2021-12-14 19:39:13,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:13,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:13,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:13,624 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:13,657 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2021-12-14 19:39:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 19:39:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:13,659 INFO L225 Difference]: With dead ends: 260 [2021-12-14 19:39:13,659 INFO L226 Difference]: Without dead ends: 260 [2021-12-14 19:39:13,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:13,660 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 80 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:13,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 548 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-14 19:39:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2021-12-14 19:39:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2021-12-14 19:39:13,668 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2021-12-14 19:39:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:13,668 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2021-12-14 19:39:13,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2021-12-14 19:39:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:13,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:13,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:13,683 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-14 19:39:13,881 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-14 19:39:13,882 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2021-12-14 19:39:13,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277834897] [2021-12-14 19:39:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:13,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:13,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:13,884 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-14 19:39:13,886 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-14 19:39:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:13,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:13,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:13,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:13,995 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:13,995 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 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-14 19:39:14,014 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-14 19:39:14,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:14,015 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:14,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277834897] [2021-12-14 19:39:14,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277834897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:14,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:14,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:14,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724181907] [2021-12-14 19:39:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:14,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:14,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:14,017 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:14,021 INFO L93 Difference]: Finished difference Result 223 states and 273 transitions. [2021-12-14 19:39:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 19:39:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:14,022 INFO L225 Difference]: With dead ends: 223 [2021-12-14 19:39:14,022 INFO L226 Difference]: Without dead ends: 223 [2021-12-14 19:39:14,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-14 19:39:14,023 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:14,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2021-12-14 19:39:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-14 19:39:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-12-14 19:39:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 138 states have (on average 1.9492753623188406) internal successors, (269), 218 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 273 transitions. [2021-12-14 19:39:14,029 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 273 transitions. Word has length 13 [2021-12-14 19:39:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:14,029 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 273 transitions. [2021-12-14 19:39:14,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 273 transitions. [2021-12-14 19:39:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:14,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:14,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:14,039 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-14 19:39:14,238 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-14 19:39:14,238 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2021-12-14 19:39:14,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:14,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973636029] [2021-12-14 19:39:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:14,239 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:14,240 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-14 19:39:14,241 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-14 19:39:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:14,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:14,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:14,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:14,342 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 9 treesize of output 11 [2021-12-14 19:39:14,348 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 20 treesize of output 18 [2021-12-14 19:39:14,366 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-14 19:39:14,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:14,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:14,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973636029] [2021-12-14 19:39:14,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973636029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:14,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:14,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:14,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866937193] [2021-12-14 19:39:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:14,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:14,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:14,369 INFO L87 Difference]: Start difference. First operand 223 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:14,727 INFO L93 Difference]: Finished difference Result 254 states and 309 transitions. [2021-12-14 19:39:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 19:39:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:14,729 INFO L225 Difference]: With dead ends: 254 [2021-12-14 19:39:14,729 INFO L226 Difference]: Without dead ends: 254 [2021-12-14 19:39:14,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-14 19:39:14,730 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 61 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:14,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-14 19:39:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 230. [2021-12-14 19:39:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.8506493506493507) internal successors, (285), 225 states have internal predecessors, (285), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 289 transitions. [2021-12-14 19:39:14,737 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 289 transitions. Word has length 13 [2021-12-14 19:39:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:14,737 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 289 transitions. [2021-12-14 19:39:14,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 289 transitions. [2021-12-14 19:39:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:14,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:14,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:14,747 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-14 19:39:14,946 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-14 19:39:14,947 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:14,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2060989769, now seen corresponding path program 1 times [2021-12-14 19:39:14,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:14,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260697274] [2021-12-14 19:39:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:14,948 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:14,948 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-14 19:39:14,949 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-14 19:39:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:15,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:15,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:15,049 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-14 19:39:15,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:15,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:15,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260697274] [2021-12-14 19:39:15,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260697274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:15,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:15,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:15,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522860838] [2021-12-14 19:39:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:15,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:15,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:15,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:15,052 INFO L87 Difference]: Start difference. First operand 230 states and 289 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:15,088 INFO L93 Difference]: Finished difference Result 243 states and 305 transitions. [2021-12-14 19:39:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:15,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:39:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:15,091 INFO L225 Difference]: With dead ends: 243 [2021-12-14 19:39:15,091 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 19:39:15,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-14 19:39:15,092 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 7 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:15,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 346 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 19:39:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2021-12-14 19:39:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 156 states have (on average 1.8397435897435896) internal successors, (287), 227 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 291 transitions. [2021-12-14 19:39:15,098 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 291 transitions. Word has length 16 [2021-12-14 19:39:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:15,098 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 291 transitions. [2021-12-14 19:39:15,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 291 transitions. [2021-12-14 19:39:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:15,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:15,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:15,108 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-14 19:39:15,308 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-14 19:39:15,308 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2060989719, now seen corresponding path program 1 times [2021-12-14 19:39:15,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:15,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426015986] [2021-12-14 19:39:15,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:15,309 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:15,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:15,311 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-14 19:39:15,312 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-14 19:39:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:15,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:15,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:15,409 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-14 19:39:15,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:15,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:15,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426015986] [2021-12-14 19:39:15,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426015986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:15,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:15,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:15,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975950452] [2021-12-14 19:39:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:15,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:15,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:15,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:15,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:15,411 INFO L87 Difference]: Start difference. First operand 232 states and 291 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:15,656 INFO L93 Difference]: Finished difference Result 229 states and 267 transitions. [2021-12-14 19:39:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:15,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:39:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:15,658 INFO L225 Difference]: With dead ends: 229 [2021-12-14 19:39:15,658 INFO L226 Difference]: Without dead ends: 229 [2021-12-14 19:39:15,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-14 19:39:15,659 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:15,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 203 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:15,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-14 19:39:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2021-12-14 19:39:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 216 states have internal predecessors, (257), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2021-12-14 19:39:15,672 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 16 [2021-12-14 19:39:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:15,672 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2021-12-14 19:39:15,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2021-12-14 19:39:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:15,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:15,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:15,685 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-14 19:39:15,881 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-14 19:39:15,882 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:15,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2021-12-14 19:39:15,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:15,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835565373] [2021-12-14 19:39:15,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:15,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:15,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:15,884 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-14 19:39:15,885 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-14 19:39:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:15,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:15,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:15,998 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:39:15,999 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-14 19:39:16,021 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-14 19:39:16,043 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 26 treesize of output 14 [2021-12-14 19:39:16,051 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-14 19:39:16,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:16,052 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:16,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835565373] [2021-12-14 19:39:16,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835565373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:16,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:16,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:16,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721070583] [2021-12-14 19:39:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:16,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:39:16,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:39:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:16,054 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:16,473 INFO L93 Difference]: Finished difference Result 226 states and 267 transitions. [2021-12-14 19:39:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:16,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-14 19:39:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:16,474 INFO L225 Difference]: With dead ends: 226 [2021-12-14 19:39:16,474 INFO L226 Difference]: Without dead ends: 226 [2021-12-14 19:39:16,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-14 19:39:16,475 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:16,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 428 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-14 19:39:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2021-12-14 19:39:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.64375) internal successors, (263), 220 states have internal predecessors, (263), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2021-12-14 19:39:16,480 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 17 [2021-12-14 19:39:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:16,480 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2021-12-14 19:39:16,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2021-12-14 19:39:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:16,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:16,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:16,492 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-14 19:39:16,681 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-14 19:39:16,682 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2021-12-14 19:39:16,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166914148] [2021-12-14 19:39:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:16,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:16,683 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-14 19:39:16,684 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-14 19:39:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:16,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:39:16,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:16,805 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:16,806 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:16,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 13 treesize of output 9 [2021-12-14 19:39:16,840 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-14 19:39:16,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 21 treesize of output 9 [2021-12-14 19:39:16,920 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-14 19:39:16,933 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-14 19:39:16,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:16,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:16,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166914148] [2021-12-14 19:39:16,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166914148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:16,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:16,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:39:16,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482017105] [2021-12-14 19:39:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:16,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:16,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:16,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:16,935 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:17,629 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2021-12-14 19:39:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-14 19:39:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:17,631 INFO L225 Difference]: With dead ends: 227 [2021-12-14 19:39:17,631 INFO L226 Difference]: Without dead ends: 227 [2021-12-14 19:39:17,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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-14 19:39:17,632 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:17,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 508 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 19:39:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-14 19:39:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2021-12-14 19:39:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2021-12-14 19:39:17,637 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2021-12-14 19:39:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:17,637 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2021-12-14 19:39:17,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2021-12-14 19:39:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:17,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:17,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:17,650 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-14 19:39:17,838 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-14 19:39:17,839 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2021-12-14 19:39:17,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:17,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483418611] [2021-12-14 19:39:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:17,840 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:17,841 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-14 19:39:17,844 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-14 19:39:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:17,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:17,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:18,017 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:18,017 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 30 treesize of output 32 [2021-12-14 19:39:18,054 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-14 19:39:18,126 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:18,127 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-14 19:39:18,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 34 treesize of output 16 [2021-12-14 19:39:18,167 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-14 19:39:18,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:18,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_230) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32))))))) (_ bv1 1)))) is different from false [2021-12-14 19:39:18,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_230) c_create_data_~data~0.base) .cse0))))))))))) is different from false [2021-12-14 19:39:18,234 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:18,234 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 33 treesize of output 34 [2021-12-14 19:39:18,237 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 58 treesize of output 46 [2021-12-14 19:39:18,241 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 22 treesize of output 18 [2021-12-14 19:39:18,320 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-14 19:39:18,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483418611] [2021-12-14 19:39:18,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483418611] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:18,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:18,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-12-14 19:39:18,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432179914] [2021-12-14 19:39:18,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:18,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:39:18,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:39:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=40, Unknown=2, NotChecked=26, Total=90 [2021-12-14 19:39:18,322 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:18,915 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2021-12-14 19:39:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:39:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:18,917 INFO L225 Difference]: With dead ends: 232 [2021-12-14 19:39:18,917 INFO L226 Difference]: Without dead ends: 232 [2021-12-14 19:39:18,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=50, Unknown=2, NotChecked=30, Total=110 [2021-12-14 19:39:18,918 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:18,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 594 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 296 Unchecked, 0.5s Time] [2021-12-14 19:39:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-14 19:39:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2021-12-14 19:39:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2021-12-14 19:39:18,922 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2021-12-14 19:39:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:18,923 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2021-12-14 19:39:18,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2021-12-14 19:39:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:18,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:18,923 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:18,939 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-14 19:39:19,124 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-14 19:39:19,124 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2021-12-14 19:39:19,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:19,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870103989] [2021-12-14 19:39:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:19,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:19,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:19,126 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-14 19:39:19,128 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-14 19:39:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:19,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:39:19,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:19,289 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:19,289 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:19,300 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 20 treesize of output 18 [2021-12-14 19:39:19,338 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-14 19:39:19,347 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-14 19:39:19,491 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:19,491 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-14 19:39:19,497 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-14 19:39:19,586 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-14 19:39:19,593 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-14 19:39:19,613 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-14 19:39:19,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:20,040 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_274) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_274) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_275) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:20,076 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_274) c_create_data_~data~0.base) .cse1) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_275) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_274) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv4 32) .cse3) (bvadd .cse2 (_ bv8 32) .cse3))))) is different from false [2021-12-14 19:39:20,132 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_274) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_275) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3) v_ArrVal_274) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-14 19:39:20,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,170 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-14 19:39:20,174 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-14 19:39:20,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 19 treesize of output 11 [2021-12-14 19:39:20,202 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,202 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-14 19:39:20,212 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,212 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-14 19:39:20,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:20,220 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 33 treesize of output 21 [2021-12-14 19:39:20,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:20,227 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 24 treesize of output 12 [2021-12-14 19:39:20,311 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-14 19:39:20,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:20,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870103989] [2021-12-14 19:39:20,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870103989] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:20,312 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:20,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 19:39:20,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785715667] [2021-12-14 19:39:20,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:20,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:39:20,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:39:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2021-12-14 19:39:20,313 INFO L87 Difference]: Start difference. First operand 224 states and 263 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:22,940 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2021-12-14 19:39:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:39:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:39:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:22,942 INFO L225 Difference]: With dead ends: 236 [2021-12-14 19:39:22,942 INFO L226 Difference]: Without dead ends: 236 [2021-12-14 19:39:22,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2021-12-14 19:39:22,943 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:22,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1083 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 669 Invalid, 0 Unknown, 264 Unchecked, 2.4s Time] [2021-12-14 19:39:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-14 19:39:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2021-12-14 19:39:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2021-12-14 19:39:22,949 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2021-12-14 19:39:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:22,949 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2021-12-14 19:39:22,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2021-12-14 19:39:22,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:39:22,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:22,953 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:22,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:23,163 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-14 19:39:23,163 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2021-12-14 19:39:23,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:23,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356657136] [2021-12-14 19:39:23,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:39:23,164 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:23,166 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-14 19:39:23,168 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-14 19:39:23,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:39:23,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:23,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 19:39:23,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:23,385 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 20 treesize of output 18 [2021-12-14 19:39:23,403 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 9 treesize of output 11 [2021-12-14 19:39:23,430 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-14 19:39:23,441 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-14 19:39:23,577 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:23,577 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-14 19:39:23,583 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-14 19:39:23,745 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:23,745 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-14 19:39:23,751 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-14 19:39:23,845 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-14 19:39:23,851 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-14 19:39:23,877 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-14 19:39:23,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:24,258 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_337) c_create_data_~data~0.base) .cse0) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_336) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_337) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2021-12-14 19:39:24,298 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_337) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_337) c_create_data_~data~0.base) .cse4) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_336) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:24,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_337) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_337) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_336) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:24,442 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_335) c_create_data_~data~0.base) .cse2) v_ArrVal_337) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_335)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_334) .cse3 v_ArrVal_337) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_336) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:24,676 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_335) c_create_data_~data~0.base) .cse3) v_ArrVal_337)) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_335))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_334) .cse5 v_ArrVal_337) c_create_data_~data~0.base) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_336) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:24,748 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_335) c_create_data_~data~0.base) .cse2) v_ArrVal_337)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_335))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_334) .cse4 v_ArrVal_337) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_336) c_create_data_~data~0.base) .cse5))))))))) is different from false [2021-12-14 19:39:24,776 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:24,777 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-14 19:39:24,786 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:24,787 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-14 19:39:24,792 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-14 19:39:24,796 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 174 treesize of output 144 [2021-12-14 19:39:24,808 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 102 treesize of output 86 [2021-12-14 19:39:24,811 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 124 treesize of output 100 [2021-12-14 19:39:24,823 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 70 treesize of output 62 [2021-12-14 19:39:24,904 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:24,904 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2021-12-14 19:39:24,919 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:24,919 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-12-14 19:39:24,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:24,928 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 92 treesize of output 56 [2021-12-14 19:39:24,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:24,934 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 50 treesize of output 32 [2021-12-14 19:39:24,942 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-14 19:39:25,054 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-14 19:39:25,055 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:25,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356657136] [2021-12-14 19:39:25,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356657136] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:25,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:25,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2021-12-14 19:39:25,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72226113] [2021-12-14 19:39:25,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:25,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:39:25,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:25,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:39:25,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2021-12-14 19:39:25,056 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:28,059 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2021-12-14 19:39:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:39:28,061 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:39:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:28,062 INFO L225 Difference]: With dead ends: 246 [2021-12-14 19:39:28,062 INFO L226 Difference]: Without dead ends: 246 [2021-12-14 19:39:28,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2021-12-14 19:39:28,063 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 22 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:28,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 1166 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 537 Invalid, 0 Unknown, 551 Unchecked, 2.5s Time] [2021-12-14 19:39:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-14 19:39:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-12-14 19:39:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2021-12-14 19:39:28,068 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 27 [2021-12-14 19:39:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:28,068 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2021-12-14 19:39:28,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2021-12-14 19:39:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:39:28,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:28,070 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:28,086 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-14 19:39:28,280 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-14 19:39:28,280 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash 852563911, now seen corresponding path program 3 times [2021-12-14 19:39:28,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:28,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840505630] [2021-12-14 19:39:28,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:28,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:28,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:28,282 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-14 19:39:28,283 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-14 19:39:28,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:28,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:28,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:39:28,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:28,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:28,788 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:28,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840505630] [2021-12-14 19:39:28,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840505630] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:28,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:28,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-14 19:39:28,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274554451] [2021-12-14 19:39:28,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:28,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:39:28,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:39:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:28,793 INFO L87 Difference]: Start difference. First operand 244 states and 283 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:28,878 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2021-12-14 19:39:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:28,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 19:39:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:28,879 INFO L225 Difference]: With dead ends: 241 [2021-12-14 19:39:28,880 INFO L226 Difference]: Without dead ends: 241 [2021-12-14 19:39:28,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:28,880 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:28,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 1123 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:39:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-14 19:39:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2021-12-14 19:39:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 275 transitions. [2021-12-14 19:39:28,886 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 275 transitions. Word has length 32 [2021-12-14 19:39:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:28,886 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 275 transitions. [2021-12-14 19:39:28,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 275 transitions. [2021-12-14 19:39:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:39:28,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:28,888 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:28,899 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-14 19:39:29,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:29,098 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting create_dataErr24REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2021-12-14 19:39:29,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:29,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717595131] [2021-12-14 19:39:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:29,099 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:29,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:29,101 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:29,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-14 19:39:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:29,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:29,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:29,364 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-14 19:39:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:29,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:29,372 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:29,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717595131] [2021-12-14 19:39:29,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717595131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:29,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:29,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:29,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775848022] [2021-12-14 19:39:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:29,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:29,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:29,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:29,376 INFO L87 Difference]: Start difference. First operand 239 states and 275 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:29,625 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2021-12-14 19:39:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-14 19:39:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:29,627 INFO L225 Difference]: With dead ends: 241 [2021-12-14 19:39:29,627 INFO L226 Difference]: Without dead ends: 241 [2021-12-14 19:39:29,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-14 19:39:29,628 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:29,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-12-14 19:39:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2021-12-14 19:39:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2021-12-14 19:39:29,632 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 41 [2021-12-14 19:39:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:29,632 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2021-12-14 19:39:29,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2021-12-14 19:39:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:39:29,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:29,633 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:29,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:29,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:29,843 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting create_dataErr25REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2021-12-14 19:39:29,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533073243] [2021-12-14 19:39:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:29,844 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:29,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:29,845 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-14 19:39:29,846 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-14 19:39:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:29,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:29,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:30,042 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-14 19:39:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:30,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:30,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:30,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533073243] [2021-12-14 19:39:30,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533073243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:30,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:30,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:30,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099365549] [2021-12-14 19:39:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:30,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:30,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:30,051 INFO L87 Difference]: Start difference. First operand 235 states and 263 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:30,260 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2021-12-14 19:39:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:30,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-14 19:39:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:30,261 INFO L225 Difference]: With dead ends: 237 [2021-12-14 19:39:30,261 INFO L226 Difference]: Without dead ends: 237 [2021-12-14 19:39:30,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-14 19:39:30,262 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:30,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-14 19:39:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2021-12-14 19:39:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2021-12-14 19:39:30,267 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 41 [2021-12-14 19:39:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:30,268 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2021-12-14 19:39:30,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2021-12-14 19:39:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:39:30,269 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:30,269 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:30,287 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-14 19:39:30,487 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-14 19:39:30,487 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:30,488 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2021-12-14 19:39:30,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:30,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574906370] [2021-12-14 19:39:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:30,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:30,489 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-14 19:39:30,491 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-14 19:39:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:30,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:30,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:30,736 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-14 19:39:30,809 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-14 19:39:30,877 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 9 [2021-12-14 19:39:31,725 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-14 19:39:31,726 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 4 case distinctions, treesize of input 29 treesize of output 45 [2021-12-14 19:39:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:31,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:32,896 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:32,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574906370] [2021-12-14 19:39:32,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574906370] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:32,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:32,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-14 19:39:32,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444213341] [2021-12-14 19:39:32,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:32,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:32,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:32,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:32,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:32,899 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:33,063 INFO L93 Difference]: Finished difference Result 272 states and 297 transitions. [2021-12-14 19:39:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-14 19:39:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:33,065 INFO L225 Difference]: With dead ends: 272 [2021-12-14 19:39:33,065 INFO L226 Difference]: Without dead ends: 272 [2021-12-14 19:39:33,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:33,065 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 63 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:33,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 256 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2021-12-14 19:39:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-14 19:39:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 243. [2021-12-14 19:39:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 187 states have (on average 1.4064171122994653) internal successors, (263), 237 states have internal predecessors, (263), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:39:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2021-12-14 19:39:33,071 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 44 [2021-12-14 19:39:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:33,071 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2021-12-14 19:39:33,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2021-12-14 19:39:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:39:33,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:33,072 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:33,087 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-14 19:39:33,285 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-14 19:39:33,285 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2021-12-14 19:39:33,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:33,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704210917] [2021-12-14 19:39:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:33,287 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:33,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:33,288 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-14 19:39:33,289 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-14 19:39:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:33,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:39:33,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:33,618 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-14 19:39:33,624 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-14 19:39:33,734 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-14 19:39:33,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 15 treesize of output 9 [2021-12-14 19:39:34,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:34,220 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:34,220 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:39:34,234 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:34,234 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 21 treesize of output 21 [2021-12-14 19:39:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:34,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:34,599 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:34,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704210917] [2021-12-14 19:39:34,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704210917] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:34,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [797178282] [2021-12-14 19:39:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:34,599 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:34,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:34,600 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:39:34,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2021-12-14 19:39:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:34,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:39:34,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:34,999 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-14 19:39:35,003 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-14 19:39:35,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:35,500 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:35,501 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:39:35,515 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:35,516 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 19 treesize of output 19 [2021-12-14 19:39:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:35,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:35,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [797178282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:35,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:35,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 19:39:35,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417517771] [2021-12-14 19:39:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:35,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:35,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:35,559 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:36,086 INFO L93 Difference]: Finished difference Result 313 states and 344 transitions. [2021-12-14 19:39:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-14 19:39:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:36,089 INFO L225 Difference]: With dead ends: 313 [2021-12-14 19:39:36,089 INFO L226 Difference]: Without dead ends: 313 [2021-12-14 19:39:36,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:36,090 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:36,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 452 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 170 Unchecked, 0.5s Time] [2021-12-14 19:39:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-14 19:39:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 246. [2021-12-14 19:39:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 239 states have internal predecessors, (264), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 270 transitions. [2021-12-14 19:39:36,096 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 270 transitions. Word has length 44 [2021-12-14 19:39:36,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:36,096 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 270 transitions. [2021-12-14 19:39:36,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 270 transitions. [2021-12-14 19:39:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:39:36,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:36,097 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:36,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:36,310 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-14 19:39:36,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:36,502 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1359492877, now seen corresponding path program 1 times [2021-12-14 19:39:36,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:36,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866561119] [2021-12-14 19:39:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:36,503 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:36,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:36,504 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-14 19:39:36,504 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-14 19:39:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:36,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:39:36,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:36,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:36,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:36,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:36,935 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-14 19:39:36,935 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-14 19:39:37,035 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-14 19:39:37,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-14 19:39:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:37,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:37,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866561119] [2021-12-14 19:39:37,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866561119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:37,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:37,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:37,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999269285] [2021-12-14 19:39:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:37,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:37,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:37,094 INFO L87 Difference]: Start difference. First operand 246 states and 270 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:37,516 INFO L93 Difference]: Finished difference Result 288 states and 320 transitions. [2021-12-14 19:39:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:39:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 19:39:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:37,522 INFO L225 Difference]: With dead ends: 288 [2021-12-14 19:39:37,522 INFO L226 Difference]: Without dead ends: 288 [2021-12-14 19:39:37,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:37,523 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 26 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:37,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 706 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-12-14 19:39:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 256. [2021-12-14 19:39:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 199 states have (on average 1.3819095477386936) internal successors, (275), 249 states have internal predecessors, (275), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2021-12-14 19:39:37,529 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 46 [2021-12-14 19:39:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:37,529 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2021-12-14 19:39:37,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2021-12-14 19:39:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:39:37,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:37,531 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:37,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-14 19:39:37,742 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-14 19:39:37,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:37,743 INFO L85 PathProgramCache]: Analyzing trace with hash 918765395, now seen corresponding path program 1 times [2021-12-14 19:39:37,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:37,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528725630] [2021-12-14 19:39:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:37,744 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:37,745 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-14 19:39:37,745 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-14 19:39:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:37,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:37,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:37,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:37,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:37,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528725630] [2021-12-14 19:39:37,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528725630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:37,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:37,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:37,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286399968] [2021-12-14 19:39:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:37,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:37,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:37,978 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:37,998 INFO L93 Difference]: Finished difference Result 264 states and 287 transitions. [2021-12-14 19:39:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 19:39:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:38,001 INFO L225 Difference]: With dead ends: 264 [2021-12-14 19:39:38,002 INFO L226 Difference]: Without dead ends: 264 [2021-12-14 19:39:38,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-14 19:39:38,003 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:38,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 455 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-14 19:39:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2021-12-14 19:39:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.3609756097560977) internal successors, (279), 255 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2021-12-14 19:39:38,010 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 46 [2021-12-14 19:39:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:38,010 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2021-12-14 19:39:38,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2021-12-14 19:39:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:39:38,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:38,011 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:38,025 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-14 19:39:38,221 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-14 19:39:38,222 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:38,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703003, now seen corresponding path program 1 times [2021-12-14 19:39:38,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:38,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328091250] [2021-12-14 19:39:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:38,223 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:38,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:38,224 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-14 19:39:38,226 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-14 19:39:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:38,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:39:38,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:38,558 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-14 19:39:38,664 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 9 [2021-12-14 19:39:39,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:39,802 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-12-14 19:39:39,803 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 4 case distinctions, treesize of input 26 treesize of output 38 [2021-12-14 19:39:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:39,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:42,044 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328091250] [2021-12-14 19:39:42,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328091250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1285399011] [2021-12-14 19:39:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:42,045 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:42,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:42,046 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:39:42,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-12-14 19:39:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:42,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:39:42,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:42,515 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 8 treesize of output 6 [2021-12-14 19:39:43,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:43,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:43,728 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:39:43,729 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 1 case distinctions, treesize of input 21 treesize of output 32 [2021-12-14 19:39:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:43,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:43,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1285399011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:43,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:43,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2021-12-14 19:39:43,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648002087] [2021-12-14 19:39:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:43,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:39:43,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:39:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=171, Unknown=1, NotChecked=0, Total=210 [2021-12-14 19:39:43,799 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:44,093 INFO L93 Difference]: Finished difference Result 301 states and 328 transitions. [2021-12-14 19:39:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:39:44,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 19:39:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:44,095 INFO L225 Difference]: With dead ends: 301 [2021-12-14 19:39:44,095 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 19:39:44,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=50, Invalid=221, Unknown=1, NotChecked=0, Total=272 [2021-12-14 19:39:44,096 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 11 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:44,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 628 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 152 Unchecked, 0.2s Time] [2021-12-14 19:39:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 19:39:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2021-12-14 19:39:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 241 states have (on average 1.3195020746887967) internal successors, (318), 291 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 19:39:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 327 transitions. [2021-12-14 19:39:44,102 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 327 transitions. Word has length 46 [2021-12-14 19:39:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:44,103 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 327 transitions. [2021-12-14 19:39:44,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 327 transitions. [2021-12-14 19:39:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:39:44,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:44,104 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:44,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:44,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-14 19:39:44,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:44,509 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703002, now seen corresponding path program 1 times [2021-12-14 19:39:44,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:44,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993151222] [2021-12-14 19:39:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:44,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:44,511 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-14 19:39:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:44,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:39:44,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:44,845 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-14 19:39:44,896 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 9 [2021-12-14 19:39:45,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:45,304 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:45,305 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 2 case distinctions, treesize of input 17 treesize of output 29 [2021-12-14 19:39:45,317 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:45,317 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 18 treesize of output 18 [2021-12-14 19:39:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:45,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:47,639 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993151222] [2021-12-14 19:39:47,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993151222] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1893338523] [2021-12-14 19:39:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:47,639 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:47,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:47,640 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:39:47,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-14 19:39:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:48,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:39:48,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:48,043 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-14 19:39:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:48,081 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-14 19:39:48,247 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 13 treesize of output 9 [2021-12-14 19:39:49,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:49,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:49,764 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:49,764 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 1 case distinctions, treesize of input 22 treesize of output 28 [2021-12-14 19:39:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:49,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:49,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1893338523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:49,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:49,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2021-12-14 19:39:49,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200809080] [2021-12-14 19:39:49,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:49,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:39:49,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:49,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:39:49,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=258, Unknown=1, NotChecked=0, Total=306 [2021-12-14 19:39:49,889 INFO L87 Difference]: Start difference. First operand 300 states and 327 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:50,384 INFO L93 Difference]: Finished difference Result 301 states and 327 transitions. [2021-12-14 19:39:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:39:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 19:39:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:50,389 INFO L225 Difference]: With dead ends: 301 [2021-12-14 19:39:50,389 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 19:39:50,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=60, Invalid=319, Unknown=1, NotChecked=0, Total=380 [2021-12-14 19:39:50,390 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 14 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:50,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 535 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 145 Unchecked, 0.4s Time] [2021-12-14 19:39:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 19:39:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2021-12-14 19:39:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 241 states have (on average 1.3153526970954357) internal successors, (317), 291 states have internal predecessors, (317), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 19:39:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 326 transitions. [2021-12-14 19:39:50,399 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 326 transitions. Word has length 46 [2021-12-14 19:39:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:50,400 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 326 transitions. [2021-12-14 19:39:50,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 326 transitions. [2021-12-14 19:39:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:39:50,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:50,401 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:50,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:50,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-14 19:39:50,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:50,805 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875696, now seen corresponding path program 1 times [2021-12-14 19:39:50,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:50,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70704887] [2021-12-14 19:39:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:50,806 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:50,807 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:50,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-14 19:39:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:51,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:51,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:51,148 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-14 19:39:51,243 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-14 19:39:51,383 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 9 [2021-12-14 19:39:52,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:52,651 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-12-14 19:39:52,651 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 4 case distinctions, treesize of input 29 treesize of output 41 [2021-12-14 19:39:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:52,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:57,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70704887] [2021-12-14 19:39:57,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70704887] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:57,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [590521614] [2021-12-14 19:39:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:57,290 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:57,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:57,291 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:39:57,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-14 19:39:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:57,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:39:57,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:57,724 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-14 19:40:00,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:40:00,278 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-14 19:40:00,278 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 2 case distinctions, treesize of input 21 treesize of output 35 [2021-12-14 19:40:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:00,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:00,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [590521614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:00,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:40:00,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2021-12-14 19:40:00,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991868471] [2021-12-14 19:40:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:00,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:40:00,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:40:00,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=97, Unknown=2, NotChecked=0, Total=132 [2021-12-14 19:40:00,296 INFO L87 Difference]: Start difference. First operand 300 states and 326 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:00,567 INFO L93 Difference]: Finished difference Result 350 states and 382 transitions. [2021-12-14 19:40:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:40:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-14 19:40:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:00,570 INFO L225 Difference]: With dead ends: 350 [2021-12-14 19:40:00,570 INFO L226 Difference]: Without dead ends: 350 [2021-12-14 19:40:00,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=33, Invalid=97, Unknown=2, NotChecked=0, Total=132 [2021-12-14 19:40:00,570 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 75 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:00,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 412 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 149 Unchecked, 0.3s Time] [2021-12-14 19:40:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-12-14 19:40:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 310. [2021-12-14 19:40:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 250 states have (on average 1.316) internal successors, (329), 300 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 340 transitions. [2021-12-14 19:40:00,580 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 340 transitions. Word has length 48 [2021-12-14 19:40:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:00,580 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 340 transitions. [2021-12-14 19:40:00,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 340 transitions. [2021-12-14 19:40:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:40:00,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:00,581 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:00,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-14 19:40:00,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-12-14 19:40:00,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 19:40:00,993 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875697, now seen corresponding path program 1 times [2021-12-14 19:40:00,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:00,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62467889] [2021-12-14 19:40:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:00,994 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:00,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:00,996 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:00,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-14 19:40:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:01,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:40:01,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:01,288 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-14 19:40:01,293 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-14 19:40:01,380 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-14 19:40:01,424 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 9 [2021-12-14 19:40:01,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:01,794 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:40:01,794 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:40:01,805 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:40:01,805 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 21 treesize of output 21 [2021-12-14 19:40:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:40:01,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:40:03,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:40:03,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62467889] [2021-12-14 19:40:03,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62467889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:40:03,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [47325286] [2021-12-14 19:40:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:03,131 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:40:03,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:40:03,132 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:40:03,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-12-14 19:40:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:03,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:40:03,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:03,702 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-14 19:40:03,706 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-14 19:40:04,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:04,175 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:40:04,175 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:40:04,186 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:40:04,186 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 19 treesize of output 19 [2021-12-14 19:40:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:04,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:04,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [47325286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:04,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:40:04,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 19:40:04,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481877262] [2021-12-14 19:40:04,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:04,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:40:04,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:40:04,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:40:04,218 INFO L87 Difference]: Start difference. First operand 310 states and 340 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:04,663 INFO L93 Difference]: Finished difference Result 374 states and 408 transitions. [2021-12-14 19:40:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:40:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-14 19:40:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:04,664 INFO L225 Difference]: With dead ends: 374 [2021-12-14 19:40:04,664 INFO L226 Difference]: Without dead ends: 374 [2021-12-14 19:40:04,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:40:04,665 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:04,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 452 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 218 Unchecked, 0.4s Time] [2021-12-14 19:40:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-12-14 19:40:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 309. [2021-12-14 19:40:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 249 states have (on average 1.3132530120481927) internal successors, (327), 300 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 338 transitions. [2021-12-14 19:40:04,672 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 338 transitions. Word has length 48 [2021-12-14 19:40:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:04,672 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 338 transitions. [2021-12-14 19:40:04,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 338 transitions. [2021-12-14 19:40:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 19:40:04,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:04,673 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:04,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0