./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 26d01a9c 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-?-26d01a9 [2023-02-17 02:58:30,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:58:30,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:58:30,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:58:30,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:58:30,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:58:30,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:58:30,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:58:30,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:58:30,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:58:30,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:58:30,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:58:30,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:58:30,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:58:30,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:58:30,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:58:30,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:58:30,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:58:30,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:58:30,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:58:30,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:58:30,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:58:30,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:58:30,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:58:30,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:58:30,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:58:30,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:58:30,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:58:30,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:58:30,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:58:30,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:58:30,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:58:30,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:58:30,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:58:30,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:58:30,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:58:30,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:58:30,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:58:30,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:58:30,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:58:30,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:58:30,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 02:58:30,885 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:58:30,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:58:30,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:58:30,886 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:58:30,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:58:30,887 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:58:30,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:58:30,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:58:30,887 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:58:30,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:58:30,888 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:58:30,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:58:30,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:58:30,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:58:30,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:58:30,889 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:58:30,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:58:30,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:58:30,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:58:30,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:58:30,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:58:30,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:58:30,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:58:30,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:58:30,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:58:30,891 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:58:30,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:58:30,891 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:58:30,891 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-17 02:58:31,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:58:31,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:58:31,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:58:31,086 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:58:31,086 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:58:31,087 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 [2023-02-17 02:58:32,140 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:58:32,328 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:58:32,329 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-17 02:58:32,335 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e1c3bff/f74a62e318b34dd3b0e2957e04271e60/FLAG32c0802b4 [2023-02-17 02:58:32,344 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e1c3bff/f74a62e318b34dd3b0e2957e04271e60 [2023-02-17 02:58:32,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:58:32,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:58:32,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:58:32,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:58:32,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:58:32,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:58:32" (1/1) ... [2023-02-17 02:58:32,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f513c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:32, skipping insertion in model container [2023-02-17 02:58:32,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:58:32" (1/1) ... [2023-02-17 02:58:32,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:58:32,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:58:32,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:58:32,670 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 02:58:32,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@8ef5d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:32, skipping insertion in model container [2023-02-17 02:58:32,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:58:32,672 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 02:58:32,673 INFO L158 Benchmark]: Toolchain (without parser) took 325.52ms. Allocated memory is still 153.1MB. Free memory was 107.7MB in the beginning and 95.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 02:58:32,674 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:58:32,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.94ms. Allocated memory is still 153.1MB. Free memory was 107.3MB in the beginning and 95.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 02:58:32,676 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.16ms. Allocated memory is still 117.4MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.94ms. Allocated memory is still 153.1MB. Free memory was 107.3MB in the beginning and 95.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. 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 of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-26d01a9 [2023-02-17 02:58:34,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:58:34,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:58:34,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:58:34,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:58:34,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:58:34,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:58:34,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:58:34,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:58:34,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:58:34,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:58:34,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:58:34,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:58:34,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:58:34,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:58:34,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:58:34,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:58:34,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:58:34,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:58:34,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:58:34,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:58:34,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:58:34,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:58:34,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:58:34,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:58:34,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:58:34,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:58:34,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:58:34,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:58:34,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:58:34,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:58:34,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:58:34,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:58:34,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:58:34,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:58:34,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:58:34,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:58:34,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:58:34,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:58:34,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:58:34,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:58:34,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 02:58:34,211 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:58:34,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:58:34,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:58:34,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:58:34,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:58:34,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:58:34,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:58:34,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:58:34,213 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:58:34,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:58:34,214 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:58:34,214 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 02:58:34,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:58:34,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:58:34,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:58:34,214 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 02:58:34,215 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 02:58:34,215 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 02:58:34,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:58:34,215 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:58:34,215 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 02:58:34,215 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 02:58:34,216 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:58:34,216 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:58:34,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:58:34,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:58:34,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:58:34,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:58:34,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:58:34,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:58:34,217 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 02:58:34,217 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 02:58:34,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:58:34,217 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:58:34,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:58:34,218 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 02:58:34,218 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:58:34,218 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-17 02:58:34,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:58:34,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:58:34,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:58:34,496 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:58:34,497 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:58:34,499 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 [2023-02-17 02:58:35,535 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:58:35,726 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:58:35,728 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-17 02:58:35,735 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f7b4059/9a7010cbb0fe49ab939aa3dc68627e78/FLAG4e26f8933 [2023-02-17 02:58:35,747 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94f7b4059/9a7010cbb0fe49ab939aa3dc68627e78 [2023-02-17 02:58:35,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:58:35,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:58:35,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:58:35,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:58:35,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:58:35,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:58:35" (1/1) ... [2023-02-17 02:58:35,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bbe4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:35, skipping insertion in model container [2023-02-17 02:58:35,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:58:35" (1/1) ... [2023-02-17 02:58:35,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:58:35,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:58:36,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:58:36,013 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 02:58:36,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:58:36,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:58:36,058 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:58:36,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:58:36,111 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:58:36,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36 WrapperNode [2023-02-17 02:58:36,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:58:36,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:58:36,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:58:36,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:58:36,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,158 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-17 02:58:36,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:58:36,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:58:36,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:58:36,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:58:36,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:58:36,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:58:36,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:58:36,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:58:36,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (1/1) ... [2023-02-17 02:58:36,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:58:36,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:58:36,230 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) [2023-02-17 02:58:36,242 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 [2023-02-17 02:58:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 02:58:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 02:58:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-17 02:58:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-17 02:58:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:58:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 02:58:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 02:58:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 02:58:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 02:58:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 02:58:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 02:58:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 02:58:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:58:36,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:58:36,385 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:58:36,386 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:58:37,018 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:58:37,023 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:58:37,023 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 02:58:37,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:58:37 BoogieIcfgContainer [2023-02-17 02:58:37,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:58:37,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:58:37,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:58:37,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:58:37,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:58:35" (1/3) ... [2023-02-17 02:58:37,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40da49ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:58:37, skipping insertion in model container [2023-02-17 02:58:37,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:58:36" (2/3) ... [2023-02-17 02:58:37,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40da49ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:58:37, skipping insertion in model container [2023-02-17 02:58:37,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:58:37" (3/3) ... [2023-02-17 02:58:37,032 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2023-02-17 02:58:37,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:58:37,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-17 02:58:37,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:58:37,085 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@da3a5df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:58:37,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-17 02:58:37,089 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) [2023-02-17 02:58:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 02:58:37,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:37,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 02:58:37,093 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2023-02-17 02:58:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:37,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268531538] [2023-02-17 02:58:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:37,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:37,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:37,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 02:58:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:37,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:58:37,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:37,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:37,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:37,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268531538] [2023-02-17 02:58:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268531538] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:37,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:37,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008778183] [2023-02-17 02:58:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:37,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:58:37,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:37,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:58:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:58:37,250 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) [2023-02-17 02:58:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:37,283 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-02-17 02:58:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:58:37,286 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 [2023-02-17 02:58:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:37,295 INFO L225 Difference]: With dead ends: 189 [2023-02-17 02:58:37,295 INFO L226 Difference]: Without dead ends: 187 [2023-02-17 02:58:37,296 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:37,300 INFO L413 NwaCegarLoop]: 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 [2023-02-17 02:58:37,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:58:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-17 02:58:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-02-17 02:58:37,335 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) [2023-02-17 02:58:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2023-02-17 02:58:37,344 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2023-02-17 02:58:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:37,344 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2023-02-17 02:58:37,344 INFO L496 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) [2023-02-17 02:58:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2023-02-17 02:58:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 02:58:37,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:37,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 02:58:37,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-17 02:58:37,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:37,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2023-02-17 02:58:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:37,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009733214] [2023-02-17 02:58:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:37,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:37,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:37,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:37,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 02:58:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:37,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:58:37,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:37,738 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:37,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:37,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 02:58:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:37,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:37,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:37,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009733214] [2023-02-17 02:58:37,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009733214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:37,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:37,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:58:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508278771] [2023-02-17 02:58:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:37,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:58:37,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:58:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:58:37,810 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) [2023-02-17 02:58:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:38,220 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2023-02-17 02:58:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:58:38,221 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 [2023-02-17 02:58:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:38,222 INFO L225 Difference]: With dead ends: 207 [2023-02-17 02:58:38,222 INFO L226 Difference]: Without dead ends: 207 [2023-02-17 02:58:38,222 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:38,223 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:38,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 287 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:58:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-17 02:58:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-02-17 02:58:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 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) [2023-02-17 02:58:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-17 02:58:38,234 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2023-02-17 02:58:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:38,234 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-17 02:58:38,234 INFO L496 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) [2023-02-17 02:58:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-17 02:58:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 02:58:38,235 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:38,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 02:58:38,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-17 02:58:38,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:38,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2023-02-17 02:58:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:38,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600932723] [2023-02-17 02:58:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:38,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:38,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:38,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 02:58:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:38,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 02:58:38,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:38,497 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:38,499 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:38,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:58:38,511 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:38,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:38,513 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:58:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:38,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:38,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:38,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600932723] [2023-02-17 02:58:38,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600932723] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:38,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:38,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:58:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023481603] [2023-02-17 02:58:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:38,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:58:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:58:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:58:38,519 INFO L87 Difference]: Start difference. First operand 181 states and 192 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) [2023-02-17 02:58:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:38,913 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2023-02-17 02:58:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:58:38,914 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 [2023-02-17 02:58:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:38,915 INFO L225 Difference]: With dead ends: 197 [2023-02-17 02:58:38,916 INFO L226 Difference]: Without dead ends: 197 [2023-02-17 02:58:38,916 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:38,916 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:38,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:58:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-17 02:58:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-02-17 02:58:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 states have internal predecessors, (195), 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) [2023-02-17 02:58:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2023-02-17 02:58:38,930 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2023-02-17 02:58:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:38,931 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2023-02-17 02:58:38,932 INFO L496 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) [2023-02-17 02:58:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2023-02-17 02:58:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 02:58:38,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:38,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 02:58:38,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:39,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:39,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2023-02-17 02:58:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:39,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452094551] [2023-02-17 02:58:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:39,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:39,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:39,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:39,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 02:58:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:39,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 02:58:39,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:39,198 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:39,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:39,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:39,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452094551] [2023-02-17 02:58:39,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452094551] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:39,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:39,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212804957] [2023-02-17 02:58:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:39,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:58:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:39,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:58:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:58:39,202 INFO L87 Difference]: Start difference. First operand 186 states and 199 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) [2023-02-17 02:58:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:39,376 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2023-02-17 02:58:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:58:39,377 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 [2023-02-17 02:58:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:39,377 INFO L225 Difference]: With dead ends: 209 [2023-02-17 02:58:39,377 INFO L226 Difference]: Without dead ends: 209 [2023-02-17 02:58:39,377 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:39,378 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:39,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 232 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-17 02:58:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2023-02-17 02:58:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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) [2023-02-17 02:58:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2023-02-17 02:58:39,383 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2023-02-17 02:58:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:39,383 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2023-02-17 02:58:39,384 INFO L496 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) [2023-02-17 02:58:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2023-02-17 02:58:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 02:58:39,384 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:39,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 02:58:39,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-17 02:58:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:39,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2023-02-17 02:58:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458648940] [2023-02-17 02:58:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:39,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:39,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:39,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:39,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 02:58:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:39,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:58:39,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:39,637 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:39,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:39,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:39,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458648940] [2023-02-17 02:58:39,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458648940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:39,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:39,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483543225] [2023-02-17 02:58:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:39,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:58:39,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:58:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:58:39,641 INFO L87 Difference]: Start difference. First operand 184 states and 196 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) [2023-02-17 02:58:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:39,864 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-17 02:58:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:58:39,864 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 [2023-02-17 02:58:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:39,865 INFO L225 Difference]: With dead ends: 182 [2023-02-17 02:58:39,865 INFO L226 Difference]: Without dead ends: 182 [2023-02-17 02:58:39,865 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:39,866 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 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.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:39,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-17 02:58:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-17 02:58:39,870 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) [2023-02-17 02:58:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-17 02:58:39,871 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2023-02-17 02:58:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:39,871 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-17 02:58:39,871 INFO L496 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) [2023-02-17 02:58:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-17 02:58:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 02:58:39,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:39,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:39,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:40,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:40,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2023-02-17 02:58:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:40,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124525034] [2023-02-17 02:58:40,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:40,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:40,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:40,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 02:58:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:40,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 02:58:40,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:40,174 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:40,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:40,188 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:58:40,209 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:40,215 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:40,239 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:40,242 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:40,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:40,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:40,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124525034] [2023-02-17 02:58:40,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124525034] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:40,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:40,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:58:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177960110] [2023-02-17 02:58:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:40,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:58:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:40,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:58:40,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:58:40,251 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) [2023-02-17 02:58:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:40,586 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2023-02-17 02:58:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:58:40,587 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 [2023-02-17 02:58:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:40,587 INFO L225 Difference]: With dead ends: 184 [2023-02-17 02:58:40,587 INFO L226 Difference]: Without dead ends: 184 [2023-02-17 02:58:40,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:58:40,588 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 6 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:40,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 606 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:58:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-17 02:58:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2023-02-17 02:58:40,601 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) [2023-02-17 02:58:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2023-02-17 02:58:40,602 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2023-02-17 02:58:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:40,603 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2023-02-17 02:58:40,603 INFO L496 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) [2023-02-17 02:58:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2023-02-17 02:58:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 02:58:40,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:40,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:40,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:40,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:40,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2023-02-17 02:58:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858642215] [2023-02-17 02:58:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:40,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:40,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:40,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 02:58:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:40,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:58:40,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:40,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:40,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858642215] [2023-02-17 02:58:40,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858642215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:40,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:40,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:58:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620908193] [2023-02-17 02:58:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:40,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:58:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:40,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:58:40,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:58:40,914 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) [2023-02-17 02:58:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:40,934 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2023-02-17 02:58:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:58:40,935 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 [2023-02-17 02:58:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:40,936 INFO L225 Difference]: With dead ends: 260 [2023-02-17 02:58:40,936 INFO L226 Difference]: Without dead ends: 260 [2023-02-17 02:58:40,936 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:40,937 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 81 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 548 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 [2023-02-17 02:58:40,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 548 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:58:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-17 02:58:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2023-02-17 02:58:40,941 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) [2023-02-17 02:58:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2023-02-17 02:58:40,942 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2023-02-17 02:58:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:40,942 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2023-02-17 02:58:40,942 INFO L496 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) [2023-02-17 02:58:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2023-02-17 02:58:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 02:58:40,943 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:40,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:40,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-17 02:58:41,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:41,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2023-02-17 02:58:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:41,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765173889] [2023-02-17 02:58:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:41,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:41,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:41,154 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:41,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 02:58:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:41,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 02:58:41,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:41,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:41,214 INFO L350 Elim1Store]: Elim1 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 25 [2023-02-17 02:58:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:41,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:41,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:41,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765173889] [2023-02-17 02:58:41,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765173889] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:41,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:41,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130462182] [2023-02-17 02:58:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:41,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:58:41,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:41,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:58:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:58:41,221 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) [2023-02-17 02:58:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:41,443 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2023-02-17 02:58:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:58:41,443 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 [2023-02-17 02:58:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:41,444 INFO L225 Difference]: With dead ends: 227 [2023-02-17 02:58:41,444 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 02:58:41,444 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:41,445 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:41,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 02:58:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2023-02-17 02:58:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 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) [2023-02-17 02:58:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2023-02-17 02:58:41,449 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2023-02-17 02:58:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:41,449 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2023-02-17 02:58:41,449 INFO L496 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) [2023-02-17 02:58:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2023-02-17 02:58:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 02:58:41,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:41,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:41,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:41,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:41,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2023-02-17 02:58:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:41,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538267147] [2023-02-17 02:58:41,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:41,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:41,660 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:41,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 02:58:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:41,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:58:41,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:58:41,741 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:41,744 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-17 02:58:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:41,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:41,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538267147] [2023-02-17 02:58:41,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538267147] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:41,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:41,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977028828] [2023-02-17 02:58:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:41,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:58:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:58:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:58:41,748 INFO L87 Difference]: Start difference. First operand 218 states and 265 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) [2023-02-17 02:58:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:41,986 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2023-02-17 02:58:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:58:41,986 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 [2023-02-17 02:58:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:41,987 INFO L225 Difference]: With dead ends: 239 [2023-02-17 02:58:41,987 INFO L226 Difference]: Without dead ends: 239 [2023-02-17 02:58:41,987 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:41,988 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:41,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 212 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-17 02:58:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2023-02-17 02:58:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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) [2023-02-17 02:58:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2023-02-17 02:58:41,993 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2023-02-17 02:58:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:41,994 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2023-02-17 02:58:41,994 INFO L496 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) [2023-02-17 02:58:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2023-02-17 02:58:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 02:58:41,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:41,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:42,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:42,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:42,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2023-02-17 02:58:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276215256] [2023-02-17 02:58:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:42,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:42,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:42,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:42,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 02:58:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:42,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:58:42,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:42,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:42,296 INFO L350 Elim1Store]: Elim1 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 25 [2023-02-17 02:58:42,302 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:42,313 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 19 [2023-02-17 02:58:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:42,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:42,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276215256] [2023-02-17 02:58:42,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276215256] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:42,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:42,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:58:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838997091] [2023-02-17 02:58:42,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:42,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:58:42,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:58:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:58:42,319 INFO L87 Difference]: Start difference. First operand 219 states and 259 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) [2023-02-17 02:58:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:42,709 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2023-02-17 02:58:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:58:42,709 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 [2023-02-17 02:58:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:42,711 INFO L225 Difference]: With dead ends: 270 [2023-02-17 02:58:42,711 INFO L226 Difference]: Without dead ends: 270 [2023-02-17 02:58:42,711 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:42,711 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:42,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 408 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:58:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-17 02:58:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-02-17 02:58:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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) [2023-02-17 02:58:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2023-02-17 02:58:42,716 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2023-02-17 02:58:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:42,716 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2023-02-17 02:58:42,716 INFO L496 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) [2023-02-17 02:58:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2023-02-17 02:58:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 02:58:42,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:42,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:42,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:42,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:42,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2023-02-17 02:58:42,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:42,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669607047] [2023-02-17 02:58:42,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:42,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:42,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:42,919 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:42,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 02:58:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:42,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 02:58:43,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:43,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:43,012 INFO L350 Elim1Store]: Elim1 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 25 [2023-02-17 02:58:43,034 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:43,045 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:43,068 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 19 [2023-02-17 02:58:43,073 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:43,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:43,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:43,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669607047] [2023-02-17 02:58:43,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669607047] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:43,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:43,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:58:43,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078760648] [2023-02-17 02:58:43,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:43,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:58:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:58:43,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:58:43,084 INFO L87 Difference]: Start difference. First operand 225 states and 269 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) [2023-02-17 02:58:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:43,556 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2023-02-17 02:58:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:58:43,558 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 [2023-02-17 02:58:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:43,559 INFO L225 Difference]: With dead ends: 227 [2023-02-17 02:58:43,559 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 02:58:43,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:58:43,559 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:43,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 421 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 02:58:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 02:58:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2023-02-17 02:58:43,562 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) [2023-02-17 02:58:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2023-02-17 02:58:43,563 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2023-02-17 02:58:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:43,563 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2023-02-17 02:58:43,563 INFO L496 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) [2023-02-17 02:58:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2023-02-17 02:58:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:58:43,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:43,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:43,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:43,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:43,765 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2023-02-17 02:58:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:43,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358938024] [2023-02-17 02:58:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:43,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:43,771 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:43,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 02:58:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:43,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 02:58:43,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:43,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:43,883 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 32 [2023-02-17 02:58:43,897 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:43,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:43,917 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 76 [2023-02-17 02:58:43,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2023-02-17 02:58:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 02:58:43,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:58:43,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_178) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1))) is different from false [2023-02-17 02:58:43,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_178) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2023-02-17 02:58:43,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:43,967 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 25 [2023-02-17 02:58:43,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-02-17 02:58:43,988 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2023-02-17 02:58:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-17 02:58:43,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:43,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358938024] [2023-02-17 02:58:43,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358938024] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:58:44,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:58:44,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-02-17 02:58:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141607377] [2023-02-17 02:58:44,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:58:44,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:58:44,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:58:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2023-02-17 02:58:44,001 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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) [2023-02-17 02:58:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:44,537 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2023-02-17 02:58:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:58:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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 [2023-02-17 02:58:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:44,538 INFO L225 Difference]: With dead ends: 232 [2023-02-17 02:58:44,538 INFO L226 Difference]: Without dead ends: 232 [2023-02-17 02:58:44,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2023-02-17 02:58:44,539 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 47 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:44,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 609 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 210 Unchecked, 0.5s Time] [2023-02-17 02:58:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-17 02:58:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-02-17 02:58:44,554 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) [2023-02-17 02:58:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2023-02-17 02:58:44,555 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2023-02-17 02:58:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:44,555 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2023-02-17 02:58:44,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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) [2023-02-17 02:58:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2023-02-17 02:58:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:58:44,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:44,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:44,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:44,763 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2023-02-17 02:58:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:44,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963289909] [2023-02-17 02:58:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:44,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:44,765 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:44,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 02:58:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:44,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:58:44,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:44,899 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-17 02:58:44,902 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:44,908 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:44,912 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:44,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:44,938 INFO L350 Elim1Store]: Elim1 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 59 [2023-02-17 02:58:44,943 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-17 02:58:44,967 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:44,971 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:44,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:58:45,094 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse1 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32))))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_224) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse0) .cse1))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse0) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))) is different from false [2023-02-17 02:58:45,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-17 02:58:45,132 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (_ bv0 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-02-17 02:58:45,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:45,141 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 52 [2023-02-17 02:58:45,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:45,145 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 42 [2023-02-17 02:58:45,148 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 62 [2023-02-17 02:58:45,151 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 102 [2023-02-17 02:58:45,158 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 44 [2023-02-17 02:58:45,159 INFO L350 Elim1Store]: Elim1 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 90 treesize of output 82 [2023-02-17 02:58:45,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:45,175 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 29 [2023-02-17 02:58:45,179 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 36 [2023-02-17 02:58:45,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:45,183 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 46 [2023-02-17 02:58:45,187 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 56 [2023-02-17 02:58:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-17 02:58:45,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:45,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963289909] [2023-02-17 02:58:45,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963289909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:58:45,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:58:45,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-17 02:58:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828209573] [2023-02-17 02:58:45,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:58:45,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 02:58:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 02:58:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-17 02:58:45,314 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) [2023-02-17 02:58:47,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:47,311 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-02-17 02:58:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:58:47,312 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 [2023-02-17 02:58:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:47,313 INFO L225 Difference]: With dead ends: 236 [2023-02-17 02:58:47,313 INFO L226 Difference]: Without dead ends: 236 [2023-02-17 02:58:47,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=179, Unknown=3, NotChecked=90, Total=342 [2023-02-17 02:58:47,313 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 6 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:47,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 917 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 511 Invalid, 0 Unknown, 262 Unchecked, 1.9s Time] [2023-02-17 02:58:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-17 02:58:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-02-17 02:58:47,317 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) [2023-02-17 02:58:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2023-02-17 02:58:47,317 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2023-02-17 02:58:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:47,317 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-02-17 02:58:47,317 INFO L496 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) [2023-02-17 02:58:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2023-02-17 02:58:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 02:58:47,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:47,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:47,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:47,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:47,527 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2023-02-17 02:58:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:47,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218700448] [2023-02-17 02:58:47,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:58:47,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:47,529 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:47,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 02:58:47,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:58:47,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:58:47,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 02:58:47,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:47,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:47,706 INFO L350 Elim1Store]: Elim1 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 25 [2023-02-17 02:58:47,709 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-17 02:58:47,718 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:47,721 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:47,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:47,748 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 73 [2023-02-17 02:58:47,754 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-17 02:58:47,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:47,794 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 73 [2023-02-17 02:58:47,801 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-17 02:58:47,836 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 23 [2023-02-17 02:58:47,840 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:47,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:58:47,971 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse1 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32))))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0) .cse1))))) is different from false [2023-02-17 02:58:47,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-17 02:58:48,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul (_ bv4 32) (bvadd (bvadd c_create_data_~counter~0 (_ bv1 32)) (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-02-17 02:58:48,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) (bvadd (bvadd c_create_data_~counter~0 (_ bv1 32)) (_ bv1 32)))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)) (_ bv4 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))) is different from false [2023-02-17 02:58:48,095 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd (bvadd c_create_data_~counter~0 (_ bv1 32)) (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse2))) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_286) c_create_data_~data~0.base) .cse2))))))))) is different from false [2023-02-17 02:58:48,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd (bvadd (_ bv1 32) (_ bv0 32)) (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse3) v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse3) v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2023-02-17 02:58:48,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:48,170 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 53 [2023-02-17 02:58:48,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:48,174 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 43 [2023-02-17 02:58:48,177 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 64 [2023-02-17 02:58:48,179 INFO L350 Elim1Store]: Elim1 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 170 treesize of output 152 [2023-02-17 02:58:48,181 INFO L350 Elim1Store]: Elim1 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 106 treesize of output 90 [2023-02-17 02:58:48,182 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 120 [2023-02-17 02:58:48,188 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 78 [2023-02-17 02:58:48,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:48,213 INFO L350 Elim1Store]: Elim1 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 103 treesize of output 94 [2023-02-17 02:58:48,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:48,218 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 74 [2023-02-17 02:58:48,222 INFO L350 Elim1Store]: Elim1 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 130 treesize of output 112 [2023-02-17 02:58:48,225 INFO L350 Elim1Store]: Elim1 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 258 treesize of output 228 [2023-02-17 02:58:48,233 INFO L350 Elim1Store]: Elim1 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 158 treesize of output 142 [2023-02-17 02:58:48,235 INFO L350 Elim1Store]: Elim1 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 208 treesize of output 184 [2023-02-17 02:58:48,242 INFO L350 Elim1Store]: Elim1 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 126 treesize of output 118 [2023-02-17 02:58:48,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:48,255 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 98 [2023-02-17 02:58:48,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:48,261 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 68 [2023-02-17 02:58:48,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:58:48,267 INFO L350 Elim1Store]: Elim1 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 108 treesize of output 72 [2023-02-17 02:58:48,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:58:48,271 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 48 [2023-02-17 02:58:48,272 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 02:58:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-02-17 02:58:48,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:48,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218700448] [2023-02-17 02:58:48,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218700448] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:58:48,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:58:48,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-02-17 02:58:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732073936] [2023-02-17 02:58:48,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:58:48,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 02:58:48,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 02:58:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2023-02-17 02:58:48,314 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) [2023-02-17 02:58:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:50,368 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2023-02-17 02:58:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:58:50,372 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 [2023-02-17 02:58:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:50,373 INFO L225 Difference]: With dead ends: 246 [2023-02-17 02:58:50,373 INFO L226 Difference]: Without dead ends: 246 [2023-02-17 02:58:50,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=265, Unknown=6, NotChecked=234, Total=600 [2023-02-17 02:58:50,373 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:50,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1338 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 719 Invalid, 0 Unknown, 570 Unchecked, 1.8s Time] [2023-02-17 02:58:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-17 02:58:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2023-02-17 02:58:50,376 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) [2023-02-17 02:58:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2023-02-17 02:58:50,377 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 27 [2023-02-17 02:58:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:50,377 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2023-02-17 02:58:50,377 INFO L496 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) [2023-02-17 02:58:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2023-02-17 02:58:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 02:58:50,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:50,378 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:58:50,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-17 02:58:50,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:50,590 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash 852563911, now seen corresponding path program 3 times [2023-02-17 02:58:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:50,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399018978] [2023-02-17 02:58:50,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 02:58:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:50,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:50,605 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:50,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 02:58:50,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 02:58:50,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:58:50,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 02:58:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:50,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:58:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:58:50,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:50,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399018978] [2023-02-17 02:58:50,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399018978] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:58:50,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:58:50,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 02:58:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559085304] [2023-02-17 02:58:50,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:58:50,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:58:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:58:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:58:50,934 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) [2023-02-17 02:58:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:51,010 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2023-02-17 02:58:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:58:51,010 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 [2023-02-17 02:58:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:51,011 INFO L225 Difference]: With dead ends: 241 [2023-02-17 02:58:51,011 INFO L226 Difference]: Without dead ends: 241 [2023-02-17 02:58:51,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:58:51,012 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:51,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:58:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-17 02:58:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2023-02-17 02:58:51,016 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) [2023-02-17 02:58:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 275 transitions. [2023-02-17 02:58:51,017 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 275 transitions. Word has length 32 [2023-02-17 02:58:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:51,017 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 275 transitions. [2023-02-17 02:58:51,017 INFO L496 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) [2023-02-17 02:58:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 275 transitions. [2023-02-17 02:58:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 02:58:51,018 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:51,018 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:51,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:51,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:51,228 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2023-02-17 02:58:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:51,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279018266] [2023-02-17 02:58:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:51,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:51,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:51,234 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:51,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 02:58:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:51,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 02:58:51,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:51,372 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:58:51,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:51,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:51,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279018266] [2023-02-17 02:58:51,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279018266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:51,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:51,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531537857] [2023-02-17 02:58:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:51,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:58:51,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:51,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:58:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:58:51,374 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) [2023-02-17 02:58:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:51,543 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2023-02-17 02:58:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:58:51,543 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 [2023-02-17 02:58:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:51,544 INFO L225 Difference]: With dead ends: 241 [2023-02-17 02:58:51,545 INFO L226 Difference]: Without dead ends: 241 [2023-02-17 02:58:51,545 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:51,545 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2023-02-17 02:58:51,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-17 02:58:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2023-02-17 02:58:51,549 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) [2023-02-17 02:58:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2023-02-17 02:58:51,549 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 41 [2023-02-17 02:58:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:51,550 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2023-02-17 02:58:51,550 INFO L496 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) [2023-02-17 02:58:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2023-02-17 02:58:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 02:58:51,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:51,550 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:51,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:51,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:51,751 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2023-02-17 02:58:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:51,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556981627] [2023-02-17 02:58:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:51,753 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:51,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 02:58:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:51,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:58:51,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:51,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:58:51,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:51,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:51,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556981627] [2023-02-17 02:58:51,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556981627] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:51,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:51,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:58:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876382147] [2023-02-17 02:58:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:51,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:58:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:51,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:58:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:58:51,954 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) [2023-02-17 02:58:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:52,161 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2023-02-17 02:58:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:58:52,162 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 [2023-02-17 02:58:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:52,163 INFO L225 Difference]: With dead ends: 237 [2023-02-17 02:58:52,163 INFO L226 Difference]: Without dead ends: 237 [2023-02-17 02:58:52,163 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:52,163 INFO L413 NwaCegarLoop]: 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 [2023-02-17 02:58:52,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-17 02:58:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2023-02-17 02:58:52,167 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) [2023-02-17 02:58:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2023-02-17 02:58:52,167 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 41 [2023-02-17 02:58:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:52,168 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2023-02-17 02:58:52,168 INFO L496 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) [2023-02-17 02:58:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2023-02-17 02:58:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 02:58:52,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:52,168 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:52,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:52,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:52,378 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2023-02-17 02:58:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:52,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343347437] [2023-02-17 02:58:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:52,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:52,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:52,380 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:52,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 02:58:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:52,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 02:58:52,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:52,638 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:52,649 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:52,659 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:52,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:52,701 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 74 [2023-02-17 02:58:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 02:58:52,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:58:54,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:54,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343347437] [2023-02-17 02:58:54,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343347437] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:58:54,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2048487002] [2023-02-17 02:58:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:54,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:58:54,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:58:54,803 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:58:54,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-17 02:58:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:55,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 02:58:55,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:55,193 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:55,197 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-17 02:58:55,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:58:55,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:55,236 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 53 [2023-02-17 02:58:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:58:55,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:55,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2048487002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:55,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:58:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-02-17 02:58:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255315807] [2023-02-17 02:58:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:55,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:58:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:58:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=65, Unknown=2, NotChecked=16, Total=110 [2023-02-17 02:58:55,247 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 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) [2023-02-17 02:58:55,321 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_#valid| create_data_~data~0.base) (_ bv1 1)) (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |c_#valid|)))) (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |c_#valid|))) is different from true [2023-02-17 02:58:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:55,887 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2023-02-17 02:58:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:58:55,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 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 [2023-02-17 02:58:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:55,889 INFO L225 Difference]: With dead ends: 284 [2023-02-17 02:58:55,889 INFO L226 Difference]: Without dead ends: 284 [2023-02-17 02:58:55,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=33, Invalid=82, Unknown=3, NotChecked=38, Total=156 [2023-02-17 02:58:55,889 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:55,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 276 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 225 Unchecked, 0.6s Time] [2023-02-17 02:58:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-17 02:58:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2023-02-17 02:58:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 248 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) [2023-02-17 02:58:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 285 transitions. [2023-02-17 02:58:55,893 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 285 transitions. Word has length 44 [2023-02-17 02:58:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:55,893 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 285 transitions. [2023-02-17 02:58:55,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 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) [2023-02-17 02:58:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 285 transitions. [2023-02-17 02:58:55,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 02:58:55,894 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:55,894 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:55,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:56,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:56,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:56,310 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:56,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2023-02-17 02:58:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:56,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515047852] [2023-02-17 02:58:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:56,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:56,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:56,313 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:56,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 02:58:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:56,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:58:56,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:56,586 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:56,588 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:56,604 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:56,618 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:56,620 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_886 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_54 (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 02:58:56,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:58:56,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:56,640 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:58:56,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:56,647 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:58:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 02:58:56,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:58:56,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:56,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515047852] [2023-02-17 02:58:56,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515047852] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:58:56,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1299737666] [2023-02-17 02:58:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:56,730 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:58:56,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:58:56,731 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:58:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-17 02:58:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:57,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:58:57,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:57,163 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:57,165 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:57,175 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_1002 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1002) |c_create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-17 02:58:57,177 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_1002 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1002) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 02:58:57,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:58:57,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:57,218 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:58:57,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:57,222 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:58:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:58:57,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:57,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1299737666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:57,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:58:57,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2023-02-17 02:58:57,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299737008] [2023-02-17 02:58:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:57,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:58:57,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:58:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=73, Unknown=3, NotChecked=54, Total=156 [2023-02-17 02:58:57,237 INFO L87 Difference]: Start difference. First operand 255 states and 285 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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) [2023-02-17 02:58:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:57,976 INFO L93 Difference]: Finished difference Result 380 states and 416 transitions. [2023-02-17 02:58:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:58:57,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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 [2023-02-17 02:58:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:57,979 INFO L225 Difference]: With dead ends: 380 [2023-02-17 02:58:57,979 INFO L226 Difference]: Without dead ends: 380 [2023-02-17 02:58:57,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=87, Unknown=3, NotChecked=60, Total=182 [2023-02-17 02:58:57,979 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 148 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:57,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 384 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 482 Invalid, 0 Unknown, 489 Unchecked, 0.7s Time] [2023-02-17 02:58:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-02-17 02:58:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 258. [2023-02-17 02:58:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 200 states have (on average 1.4) internal successors, (280), 250 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:58:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 287 transitions. [2023-02-17 02:58:57,988 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 287 transitions. Word has length 44 [2023-02-17 02:58:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:57,989 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 287 transitions. [2023-02-17 02:58:57,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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) [2023-02-17 02:58:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 287 transitions. [2023-02-17 02:58:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 02:58:57,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:57,992 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:57,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:58,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:58,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:58,405 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1359492877, now seen corresponding path program 1 times [2023-02-17 02:58:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:58,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194782632] [2023-02-17 02:58:58,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:58,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:58,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:58,408 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:58,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 02:58:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:58,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:58:58,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:58,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:58:58,635 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:58:58,635 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 02:58:58,649 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 39 [2023-02-17 02:58:58,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:58,656 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 26 [2023-02-17 02:58:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:58:58,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:58,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:58,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194782632] [2023-02-17 02:58:58,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194782632] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:58,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:58,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:58:58,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975395985] [2023-02-17 02:58:58,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:58,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:58:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:58:58,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:58:58,673 INFO L87 Difference]: Start difference. First operand 258 states and 287 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) [2023-02-17 02:58:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:58,915 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2023-02-17 02:58:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:58:58,916 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 [2023-02-17 02:58:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:58,917 INFO L225 Difference]: With dead ends: 296 [2023-02-17 02:58:58,917 INFO L226 Difference]: Without dead ends: 296 [2023-02-17 02:58:58,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:58:58,917 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:58:58,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 706 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:58:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-17 02:58:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2023-02-17 02:58:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 208 states have (on average 1.3846153846153846) internal successors, (288), 258 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:58:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2023-02-17 02:58:58,922 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 46 [2023-02-17 02:58:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:58,922 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2023-02-17 02:58:58,922 INFO L496 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) [2023-02-17 02:58:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2023-02-17 02:58:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 02:58:58,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:58,923 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:58,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:59,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:59,130 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:59,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash 918765395, now seen corresponding path program 1 times [2023-02-17 02:58:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:59,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481613787] [2023-02-17 02:58:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:59,132 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:59,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-17 02:58:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:59,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 02:58:59,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:58:59,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:58:59,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:58:59,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481613787] [2023-02-17 02:58:59,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481613787] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:58:59,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:58:59,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:58:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963388133] [2023-02-17 02:58:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:58:59,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:58:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:58:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:58:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:58:59,292 INFO L87 Difference]: Start difference. First operand 266 states and 295 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) [2023-02-17 02:58:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:58:59,304 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2023-02-17 02:58:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:58:59,305 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 [2023-02-17 02:58:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:58:59,305 INFO L225 Difference]: With dead ends: 274 [2023-02-17 02:58:59,306 INFO L226 Difference]: Without dead ends: 274 [2023-02-17 02:58:59,306 INFO L412 NwaCegarLoop]: 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 [2023-02-17 02:58:59,306 INFO L413 NwaCegarLoop]: 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 [2023-02-17 02:58:59,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 455 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:58:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-17 02:58:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2023-02-17 02:58:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 214 states have (on average 1.355140186915888) internal successors, (290), 264 states have internal predecessors, (290), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:58:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2023-02-17 02:58:59,311 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 46 [2023-02-17 02:58:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:58:59,311 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2023-02-17 02:58:59,311 INFO L496 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) [2023-02-17 02:58:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2023-02-17 02:58:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 02:58:59,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:58:59,312 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:58:59,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-17 02:58:59,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:59,520 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:58:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:58:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703003, now seen corresponding path program 1 times [2023-02-17 02:58:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:58:59,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309630178] [2023-02-17 02:58:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:58:59,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:58:59,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:58:59,522 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:58:59,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-17 02:58:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:58:59,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 02:58:59,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:58:59,816 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:59,827 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:59,837 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:58:59,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:58:59,860 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 74 [2023-02-17 02:58:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 02:58:59,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:03,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:03,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309630178] [2023-02-17 02:59:03,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309630178] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:03,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1262524037] [2023-02-17 02:59:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:03,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:59:03,989 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:59:03,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-17 02:59:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:04,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:59:04,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:04,444 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-17 02:59:04,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:04,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:04,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:04,508 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 33 [2023-02-17 02:59:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:04,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:04,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1262524037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:04,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:59:04,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-02-17 02:59:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365199969] [2023-02-17 02:59:04,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:04,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:59:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:59:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2023-02-17 02:59:04,578 INFO L87 Difference]: Start difference. First operand 272 states and 297 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) [2023-02-17 02:59:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:05,623 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2023-02-17 02:59:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:59:05,624 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 [2023-02-17 02:59:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:05,625 INFO L225 Difference]: With dead ends: 360 [2023-02-17 02:59:05,625 INFO L226 Difference]: Without dead ends: 360 [2023-02-17 02:59:05,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=60, Invalid=244, Unknown=2, NotChecked=0, Total=306 [2023-02-17 02:59:05,626 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 523 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 19 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:05,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 374 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 408 Invalid, 16 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 02:59:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-02-17 02:59:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 283. [2023-02-17 02:59:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 223 states have (on average 1.3632286995515694) internal successors, (304), 273 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 02:59:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2023-02-17 02:59:05,631 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 46 [2023-02-17 02:59:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:05,631 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2023-02-17 02:59:05,631 INFO L496 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) [2023-02-17 02:59:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2023-02-17 02:59:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 02:59:05,632 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:05,632 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:59:05,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:05,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:06,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:06,040 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703002, now seen corresponding path program 1 times [2023-02-17 02:59:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:06,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291100944] [2023-02-17 02:59:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:06,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:06,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:06,042 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:06,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 02:59:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:06,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:59:06,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:06,294 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:06,338 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:06,352 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:06,355 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1554 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1554) v_arrayElimCell_70 (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 02:59:06,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:06,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:06,386 INFO L350 Elim1Store]: Elim1 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 49 [2023-02-17 02:59:06,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:06,391 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 02:59:06,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:08,465 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_create_data_~data~0.base_57 (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_57))))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (and (or .cse0 (bvule |c_ULTIMATE.start_append_~pointerToList#1.offset| .cse1)) (or (bvule (_ bv0 32) |c_ULTIMATE.start_append_~pointerToList#1.offset|) .cse0) (forall ((v_create_data_~data~0.base_57 (_ BitVec 32))) (or (forall ((|v_create_data_#t~malloc7.base_29| (_ BitVec 32)) (v_ArrVal_1562 (_ BitVec 32))) (bvule .cse1 (select (store (store |c_#length| v_create_data_~data~0.base_57 v_ArrVal_1562) |v_create_data_#t~malloc7.base_29| (_ bv80 32)) |c_ULTIMATE.start_append_~pointerToList#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_57))))))) is different from false [2023-02-17 02:59:08,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:08,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291100944] [2023-02-17 02:59:08,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291100944] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:08,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136673910] [2023-02-17 02:59:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:59:08,470 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) [2023-02-17 02:59:08,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-17 02:59:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:08,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 02:59:08,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:08,877 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:08,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:08,897 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:08,944 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:09,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:09,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:09,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:09,059 INFO L350 Elim1Store]: Elim1 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 38 [2023-02-17 02:59:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:09,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1136673910] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:09,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:59:09,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-02-17 02:59:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391824672] [2023-02-17 02:59:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:09,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:59:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:59:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=5, NotChecked=58, Total=306 [2023-02-17 02:59:09,221 INFO L87 Difference]: Start difference. First operand 283 states and 313 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) [2023-02-17 02:59:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:10,608 INFO L93 Difference]: Finished difference Result 503 states and 553 transitions. [2023-02-17 02:59:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:59:10,609 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 [2023-02-17 02:59:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:10,611 INFO L225 Difference]: With dead ends: 503 [2023-02-17 02:59:10,611 INFO L226 Difference]: Without dead ends: 503 [2023-02-17 02:59:10,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=57, Invalid=250, Unknown=7, NotChecked=66, Total=380 [2023-02-17 02:59:10,611 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 356 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 16 mSolverCounterUnsat, 116 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 116 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:10,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 439 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 412 Invalid, 116 Unknown, 0 Unchecked, 1.3s Time] [2023-02-17 02:59:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-17 02:59:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 437. [2023-02-17 02:59:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 370 states have (on average 1.3216216216216217) internal successors, (489), 420 states have internal predecessors, (489), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-17 02:59:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 507 transitions. [2023-02-17 02:59:10,619 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 507 transitions. Word has length 46 [2023-02-17 02:59:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:10,620 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 507 transitions. [2023-02-17 02:59:10,620 INFO L496 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) [2023-02-17 02:59:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 507 transitions. [2023-02-17 02:59:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:59:10,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:10,620 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:59:10,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:10,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:11,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:11,021 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875696, now seen corresponding path program 1 times [2023-02-17 02:59:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:11,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394787762] [2023-02-17 02:59:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:11,024 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:11,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-17 02:59:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:11,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 02:59:11,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:11,361 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:11,372 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:11,400 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:11,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:11,425 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 74 [2023-02-17 02:59:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 02:59:11,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:11,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:11,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394787762] [2023-02-17 02:59:11,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394787762] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:11,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:59:11,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-02-17 02:59:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579722283] [2023-02-17 02:59:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:59:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:59:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:11,657 INFO L87 Difference]: Start difference. First operand 437 states and 507 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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) [2023-02-17 02:59:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:11,944 INFO L93 Difference]: Finished difference Result 460 states and 527 transitions. [2023-02-17 02:59:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:59:11,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 [2023-02-17 02:59:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:11,946 INFO L225 Difference]: With dead ends: 460 [2023-02-17 02:59:11,946 INFO L226 Difference]: Without dead ends: 460 [2023-02-17 02:59:11,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:11,946 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:11,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:59:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-02-17 02:59:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 415. [2023-02-17 02:59:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 352 states have (on average 1.3096590909090908) internal successors, (461), 400 states have internal predecessors, (461), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 477 transitions. [2023-02-17 02:59:11,953 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 477 transitions. Word has length 48 [2023-02-17 02:59:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:11,953 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 477 transitions. [2023-02-17 02:59:11,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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) [2023-02-17 02:59:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 477 transitions. [2023-02-17 02:59:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:59:11,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:11,953 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:59:11,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:12,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:12,154 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875697, now seen corresponding path program 1 times [2023-02-17 02:59:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:12,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189785264] [2023-02-17 02:59:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:12,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:12,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:12,156 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:12,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-17 02:59:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:12,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:59:12,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:12,491 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:12,493 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:12,513 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:12,539 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:12,541 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_1892 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1892) v_arrayElimCell_80 (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 02:59:12,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:12,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:12,559 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:59:12,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:12,563 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 02:59:12,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:12,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:12,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189785264] [2023-02-17 02:59:12,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189785264] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:12,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [133018582] [2023-02-17 02:59:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:12,622 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:12,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:59:12,623 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:59:12,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-02-17 02:59:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:13,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:59:13,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:13,067 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:13,069 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:13,073 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_2006 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2006) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-17 02:59:13,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:13,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:13,107 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:59:13,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:13,113 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:13,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:13,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [133018582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:13,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:59:13,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-17 02:59:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884809198] [2023-02-17 02:59:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:59:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:59:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=72, Unknown=2, NotChecked=34, Total=132 [2023-02-17 02:59:13,129 INFO L87 Difference]: Start difference. First operand 415 states and 477 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 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) [2023-02-17 02:59:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:13,819 INFO L93 Difference]: Finished difference Result 600 states and 697 transitions. [2023-02-17 02:59:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:59:13,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 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 [2023-02-17 02:59:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:13,821 INFO L225 Difference]: With dead ends: 600 [2023-02-17 02:59:13,821 INFO L226 Difference]: Without dead ends: 600 [2023-02-17 02:59:13,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=103, Unknown=2, NotChecked=42, Total=182 [2023-02-17 02:59:13,822 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 230 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:13,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 480 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 509 Invalid, 0 Unknown, 319 Unchecked, 0.7s Time] [2023-02-17 02:59:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-02-17 02:59:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 421. [2023-02-17 02:59:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 358 states have (on average 1.3100558659217878) internal successors, (469), 406 states have internal predecessors, (469), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 485 transitions. [2023-02-17 02:59:13,831 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 485 transitions. Word has length 48 [2023-02-17 02:59:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:13,831 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 485 transitions. [2023-02-17 02:59:13,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 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) [2023-02-17 02:59:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 485 transitions. [2023-02-17 02:59:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:59:13,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:13,832 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:59:13,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:14,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:14,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:14,247 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 471257990, now seen corresponding path program 1 times [2023-02-17 02:59:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:14,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061143497] [2023-02-17 02:59:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:14,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:14,250 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:14,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-17 02:59:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:14,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:59:14,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:14,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:14,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061143497] [2023-02-17 02:59:14,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061143497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:14,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:14,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:59:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686675785] [2023-02-17 02:59:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:14,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:59:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:59:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:59:14,447 INFO L87 Difference]: Start difference. First operand 421 states and 485 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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) [2023-02-17 02:59:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:14,625 INFO L93 Difference]: Finished difference Result 420 states and 483 transitions. [2023-02-17 02:59:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:59:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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 [2023-02-17 02:59:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:14,626 INFO L225 Difference]: With dead ends: 420 [2023-02-17 02:59:14,626 INFO L226 Difference]: Without dead ends: 420 [2023-02-17 02:59:14,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:59:14,627 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:14,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 215 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:59:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-02-17 02:59:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2023-02-17 02:59:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 358 states have (on average 1.3044692737430168) internal successors, (467), 405 states have internal predecessors, (467), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 483 transitions. [2023-02-17 02:59:14,633 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 483 transitions. Word has length 48 [2023-02-17 02:59:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:14,633 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 483 transitions. [2023-02-17 02:59:14,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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) [2023-02-17 02:59:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 483 transitions. [2023-02-17 02:59:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 02:59:14,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:14,634 INFO L195 NwaCegarLoop]: 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] [2023-02-17 02:59:14,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:14,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:14,843 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 471257991, now seen corresponding path program 1 times [2023-02-17 02:59:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317909164] [2023-02-17 02:59:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:14,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:14,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:14,861 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:14,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-17 02:59:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:15,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 02:59:15,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:15,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:15,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:15,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317909164] [2023-02-17 02:59:15,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317909164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:15,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:15,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 02:59:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204489795] [2023-02-17 02:59:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:15,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:59:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:15,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:59:15,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:59:15,069 INFO L87 Difference]: Start difference. First operand 420 states and 483 transitions. Second operand has 5 states, 4 states have (on average 9.0) 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) [2023-02-17 02:59:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:15,376 INFO L93 Difference]: Finished difference Result 411 states and 471 transitions. [2023-02-17 02:59:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:59:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) 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 [2023-02-17 02:59:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:15,389 INFO L225 Difference]: With dead ends: 411 [2023-02-17 02:59:15,390 INFO L226 Difference]: Without dead ends: 411 [2023-02-17 02:59:15,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:59:15,391 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 143 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:15,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 210 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:59:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-02-17 02:59:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2023-02-17 02:59:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 358 states have (on average 1.270949720670391) internal successors, (455), 396 states have internal predecessors, (455), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 471 transitions. [2023-02-17 02:59:15,399 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 471 transitions. Word has length 48 [2023-02-17 02:59:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:15,399 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 471 transitions. [2023-02-17 02:59:15,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) 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) [2023-02-17 02:59:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 471 transitions. [2023-02-17 02:59:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 02:59:15,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:15,400 INFO L195 NwaCegarLoop]: 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, 1] [2023-02-17 02:59:15,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-02-17 02:59:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:15,608 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095953, now seen corresponding path program 1 times [2023-02-17 02:59:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:15,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980973453] [2023-02-17 02:59:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:15,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:15,633 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:15,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-17 02:59:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:15,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:59:15,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:15,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:15,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:59:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:15,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:15,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:15,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980973453] [2023-02-17 02:59:15,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980973453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:15,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:15,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:59:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789919016] [2023-02-17 02:59:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:59:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:15,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:59:15,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:59:15,874 INFO L87 Difference]: Start difference. First operand 411 states and 471 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-02-17 02:59:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:16,211 INFO L93 Difference]: Finished difference Result 432 states and 492 transitions. [2023-02-17 02:59:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:59:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 49 [2023-02-17 02:59:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:16,213 INFO L225 Difference]: With dead ends: 432 [2023-02-17 02:59:16,213 INFO L226 Difference]: Without dead ends: 432 [2023-02-17 02:59:16,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:16,213 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:16,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 357 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:59:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-02-17 02:59:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 410. [2023-02-17 02:59:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 358 states have (on average 1.26536312849162) internal successors, (453), 395 states have internal predecessors, (453), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 469 transitions. [2023-02-17 02:59:16,218 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 469 transitions. Word has length 49 [2023-02-17 02:59:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:16,218 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 469 transitions. [2023-02-17 02:59:16,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-02-17 02:59:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 469 transitions. [2023-02-17 02:59:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 02:59:16,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:16,219 INFO L195 NwaCegarLoop]: 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, 1] [2023-02-17 02:59:16,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:16,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:16,428 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:16,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095954, now seen corresponding path program 1 times [2023-02-17 02:59:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:16,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460138773] [2023-02-17 02:59:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:16,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:16,430 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:16,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-17 02:59:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:16,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 02:59:16,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:16,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:16,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:16,658 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-17 02:59:16,659 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:16,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:16,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:16,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460138773] [2023-02-17 02:59:16,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460138773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:16,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:16,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:59:16,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12413907] [2023-02-17 02:59:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:16,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:59:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:16,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:59:16,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:59:16,667 INFO L87 Difference]: Start difference. First operand 410 states and 469 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-02-17 02:59:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:17,018 INFO L93 Difference]: Finished difference Result 448 states and 507 transitions. [2023-02-17 02:59:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:59:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 49 [2023-02-17 02:59:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:17,020 INFO L225 Difference]: With dead ends: 448 [2023-02-17 02:59:17,020 INFO L226 Difference]: Without dead ends: 448 [2023-02-17 02:59:17,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:17,021 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 283 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:17,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 305 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:59:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-02-17 02:59:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 409. [2023-02-17 02:59:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 358 states have (on average 1.2597765363128492) internal successors, (451), 394 states have internal predecessors, (451), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 467 transitions. [2023-02-17 02:59:17,026 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 467 transitions. Word has length 49 [2023-02-17 02:59:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:17,026 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 467 transitions. [2023-02-17 02:59:17,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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) [2023-02-17 02:59:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 467 transitions. [2023-02-17 02:59:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:59:17,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:17,027 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2023-02-17 02:59:17,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:17,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:17,227 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash -42553449, now seen corresponding path program 1 times [2023-02-17 02:59:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165999112] [2023-02-17 02:59:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:17,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:17,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:17,229 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:17,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-17 02:59:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:17,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:59:17,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:17,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:17,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:59:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:17,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:17,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:17,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165999112] [2023-02-17 02:59:17,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165999112] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:17,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:17,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:59:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609306508] [2023-02-17 02:59:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:17,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:59:17,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:59:17,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:59:17,486 INFO L87 Difference]: Start difference. First operand 409 states and 467 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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) [2023-02-17 02:59:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:17,785 INFO L93 Difference]: Finished difference Result 432 states and 490 transitions. [2023-02-17 02:59:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:59:17,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 53 [2023-02-17 02:59:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:17,802 INFO L225 Difference]: With dead ends: 432 [2023-02-17 02:59:17,802 INFO L226 Difference]: Without dead ends: 432 [2023-02-17 02:59:17,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:17,803 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 179 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:17,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 326 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:59:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-02-17 02:59:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 408. [2023-02-17 02:59:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 358 states have (on average 1.2541899441340782) internal successors, (449), 393 states have internal predecessors, (449), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 465 transitions. [2023-02-17 02:59:17,825 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 465 transitions. Word has length 53 [2023-02-17 02:59:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:17,826 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 465 transitions. [2023-02-17 02:59:17,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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) [2023-02-17 02:59:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 465 transitions. [2023-02-17 02:59:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:59:17,826 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:17,826 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2023-02-17 02:59:17,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:18,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:18,027 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash -42553448, now seen corresponding path program 1 times [2023-02-17 02:59:18,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:18,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320571126] [2023-02-17 02:59:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:18,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:18,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:18,041 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:18,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-17 02:59:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:18,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 02:59:18,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:18,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:18,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:18,287 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:18,288 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-17 02:59:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:18,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:18,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:18,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320571126] [2023-02-17 02:59:18,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320571126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:18,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:18,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:59:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515682640] [2023-02-17 02:59:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:18,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:59:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:18,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:59:18,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:59:18,296 INFO L87 Difference]: Start difference. First operand 408 states and 465 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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) [2023-02-17 02:59:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:18,621 INFO L93 Difference]: Finished difference Result 448 states and 505 transitions. [2023-02-17 02:59:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:59:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 53 [2023-02-17 02:59:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:18,623 INFO L225 Difference]: With dead ends: 448 [2023-02-17 02:59:18,623 INFO L226 Difference]: Without dead ends: 448 [2023-02-17 02:59:18,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:18,624 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 266 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:18,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 308 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 02:59:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-02-17 02:59:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 407. [2023-02-17 02:59:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 358 states have (on average 1.2486033519553073) internal successors, (447), 392 states have internal predecessors, (447), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 463 transitions. [2023-02-17 02:59:18,629 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 463 transitions. Word has length 53 [2023-02-17 02:59:18,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:18,629 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 463 transitions. [2023-02-17 02:59:18,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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) [2023-02-17 02:59:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 463 transitions. [2023-02-17 02:59:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:59:18,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:18,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:18,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:18,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:18,838 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting create_dataErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982670, now seen corresponding path program 1 times [2023-02-17 02:59:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:18,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669790063] [2023-02-17 02:59:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:18,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:18,853 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:18,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-17 02:59:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:19,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:59:19,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:19,350 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:19,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:19,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 02:59:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:19,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:19,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:19,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669790063] [2023-02-17 02:59:19,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669790063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:59:19,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:59:19,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-17 02:59:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726879106] [2023-02-17 02:59:19,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:59:19,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 02:59:19,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:19,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 02:59:19,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 02:59:19,369 INFO L87 Difference]: Start difference. First operand 407 states and 463 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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) [2023-02-17 02:59:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:19,576 INFO L93 Difference]: Finished difference Result 406 states and 461 transitions. [2023-02-17 02:59:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:59:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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 53 [2023-02-17 02:59:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:19,577 INFO L225 Difference]: With dead ends: 406 [2023-02-17 02:59:19,577 INFO L226 Difference]: Without dead ends: 406 [2023-02-17 02:59:19,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:59:19,578 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:19,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 238 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:59:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-02-17 02:59:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2023-02-17 02:59:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 391 states have internal predecessors, (445), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 461 transitions. [2023-02-17 02:59:19,594 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 461 transitions. Word has length 53 [2023-02-17 02:59:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:19,594 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 461 transitions. [2023-02-17 02:59:19,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 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) [2023-02-17 02:59:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 461 transitions. [2023-02-17 02:59:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:59:19,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:19,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:19,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:19,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:19,796 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982671, now seen corresponding path program 1 times [2023-02-17 02:59:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967597268] [2023-02-17 02:59:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:19,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:19,798 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:19,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-17 02:59:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:20,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 02:59:20,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:20,224 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:20,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:20,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 02:59:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:20,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:20,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967597268] [2023-02-17 02:59:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967597268] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:59:20,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:59:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-02-17 02:59:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451554194] [2023-02-17 02:59:20,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:59:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:59:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:59:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:59:20,315 INFO L87 Difference]: Start difference. First operand 406 states and 461 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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) [2023-02-17 02:59:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:20,725 INFO L93 Difference]: Finished difference Result 402 states and 453 transitions. [2023-02-17 02:59:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 02:59:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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 53 [2023-02-17 02:59:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:20,727 INFO L225 Difference]: With dead ends: 402 [2023-02-17 02:59:20,727 INFO L226 Difference]: Without dead ends: 402 [2023-02-17 02:59:20,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:59:20,727 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:20,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 312 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:59:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-02-17 02:59:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 388. [2023-02-17 02:59:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 344 states have (on average 1.2296511627906976) internal successors, (423), 373 states have internal predecessors, (423), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 439 transitions. [2023-02-17 02:59:20,732 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 439 transitions. Word has length 53 [2023-02-17 02:59:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:20,732 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 439 transitions. [2023-02-17 02:59:20,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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) [2023-02-17 02:59:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 439 transitions. [2023-02-17 02:59:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 02:59:20,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:20,732 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:20,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:20,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:20,944 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156755, now seen corresponding path program 1 times [2023-02-17 02:59:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:20,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763679517] [2023-02-17 02:59:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:20,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:20,946 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:20,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-17 02:59:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:21,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 02:59:21,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:21,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:21,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:21,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:21,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2023-02-17 02:59:21,377 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:21,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:21,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 136 treesize of output 237 [2023-02-17 02:59:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 02:59:31,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:31,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:31,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763679517] [2023-02-17 02:59:31,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763679517] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:31,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:31,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-17 02:59:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559018741] [2023-02-17 02:59:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:31,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:59:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:59:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:59:31,828 INFO L87 Difference]: Start difference. First operand 388 states and 439 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2023-02-17 02:59:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:32,881 INFO L93 Difference]: Finished difference Result 467 states and 539 transitions. [2023-02-17 02:59:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:59:32,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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 54 [2023-02-17 02:59:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:32,883 INFO L225 Difference]: With dead ends: 467 [2023-02-17 02:59:32,883 INFO L226 Difference]: Without dead ends: 467 [2023-02-17 02:59:32,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:59:32,884 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 219 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:32,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 588 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 02:59:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-02-17 02:59:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 406. [2023-02-17 02:59:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 362 states have (on average 1.2320441988950277) internal successors, (446), 391 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 462 transitions. [2023-02-17 02:59:32,889 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 462 transitions. Word has length 54 [2023-02-17 02:59:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:32,889 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 462 transitions. [2023-02-17 02:59:32,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2023-02-17 02:59:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 462 transitions. [2023-02-17 02:59:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 02:59:32,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:32,890 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:32,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-02-17 02:59:33,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:33,100 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:33,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156754, now seen corresponding path program 1 times [2023-02-17 02:59:33,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:33,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032142172] [2023-02-17 02:59:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:33,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:33,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:33,103 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:33,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-17 02:59:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:33,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 02:59:33,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:33,447 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:33,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:33,450 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:33,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:33,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:33,511 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 24 [2023-02-17 02:59:33,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 02:59:33,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:33,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 69 [2023-02-17 02:59:33,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:33,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2023-02-17 02:59:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:33,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:33,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032142172] [2023-02-17 02:59:33,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032142172] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:33,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:33,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 02:59:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643531070] [2023-02-17 02:59:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:33,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:59:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:59:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:59:33,568 INFO L87 Difference]: Start difference. First operand 406 states and 462 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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) [2023-02-17 02:59:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:34,851 INFO L93 Difference]: Finished difference Result 516 states and 572 transitions. [2023-02-17 02:59:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:59:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 54 [2023-02-17 02:59:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:34,853 INFO L225 Difference]: With dead ends: 516 [2023-02-17 02:59:34,854 INFO L226 Difference]: Without dead ends: 516 [2023-02-17 02:59:34,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:59:34,855 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 391 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:34,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 602 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 02:59:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-02-17 02:59:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 406. [2023-02-17 02:59:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 362 states have (on average 1.2265193370165746) internal successors, (444), 391 states have internal predecessors, (444), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 460 transitions. [2023-02-17 02:59:34,864 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 460 transitions. Word has length 54 [2023-02-17 02:59:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:34,865 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 460 transitions. [2023-02-17 02:59:34,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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) [2023-02-17 02:59:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 460 transitions. [2023-02-17 02:59:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-17 02:59:34,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:34,865 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:34,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:35,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:35,077 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1610777396, now seen corresponding path program 1 times [2023-02-17 02:59:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:35,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355974053] [2023-02-17 02:59:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:35,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:35,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:35,079 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:35,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-17 02:59:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:35,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:59:35,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:35,675 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:35,676 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:35,694 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515)))) is different from true [2023-02-17 02:59:35,717 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)))) is different from true [2023-02-17 02:59:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:35,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:35,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 02:59:35,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:35,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 02:59:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 02:59:35,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:35,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:35,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355974053] [2023-02-17 02:59:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355974053] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:35,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2047547977] [2023-02-17 02:59:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:35,808 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:35,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:59:35,809 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:59:35,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-02-17 02:59:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:36,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:59:36,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:36,601 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:36,602 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:36,655 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3719 (_ BitVec 32)) (v_ArrVal_3717 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3717) |create_data_#t~malloc7.base| v_ArrVal_3719) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) is different from true [2023-02-17 02:59:36,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:36,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:36,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:36,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 02:59:36,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:36,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 02:59:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 02:59:36,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2047547977] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:40,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:59:40,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-17 02:59:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581587284] [2023-02-17 02:59:40,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:59:40,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:59:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:59:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=87, Unknown=5, NotChecked=60, Total=182 [2023-02-17 02:59:40,748 INFO L87 Difference]: Start difference. First operand 406 states and 460 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 02:59:40,827 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_3515 (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |c_create_data_#t~malloc7.base| v_ArrVal_3515))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |c_create_data_#t~malloc7.base|)))) (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515))))) is different from true [2023-02-17 02:59:40,831 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515)))) (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_3719 (_ BitVec 32)) (v_ArrVal_3717 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3717) |create_data_#t~malloc7.base| v_ArrVal_3719)))))) is different from true [2023-02-17 02:59:40,851 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3719 (_ BitVec 32)) (v_ArrVal_3717 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3717) |create_data_#t~malloc7.base| v_ArrVal_3719) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|))))) is different from true [2023-02-17 02:59:43,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 02:59:45,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 02:59:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:45,626 INFO L93 Difference]: Finished difference Result 565 states and 636 transitions. [2023-02-17 02:59:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:59:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-02-17 02:59:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:45,628 INFO L225 Difference]: With dead ends: 565 [2023-02-17 02:59:45,628 INFO L226 Difference]: Without dead ends: 565 [2023-02-17 02:59:45,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=48, Invalid=124, Unknown=8, NotChecked=162, Total=342 [2023-02-17 02:59:45,629 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 198 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 5 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:45,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 689 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 510 Invalid, 30 Unknown, 793 Unchecked, 4.8s Time] [2023-02-17 02:59:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2023-02-17 02:59:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 427. [2023-02-17 02:59:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 382 states have (on average 1.2225130890052356) internal successors, (467), 411 states have internal predecessors, (467), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (14), 11 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-17 02:59:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 485 transitions. [2023-02-17 02:59:45,634 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 485 transitions. Word has length 55 [2023-02-17 02:59:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:45,634 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 485 transitions. [2023-02-17 02:59:45,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 02:59:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 485 transitions. [2023-02-17 02:59:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 02:59:45,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:45,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:45,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:45,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:46,051 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 948367783, now seen corresponding path program 1 times [2023-02-17 02:59:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:46,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934022359] [2023-02-17 02:59:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:46,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:46,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:46,054 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-02-17 02:59:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:46,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:59:46,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:46,425 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:46,427 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:46,442 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:46,456 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:46,459 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3849 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3849) v_arrayElimCell_122 (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 02:59:46,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:46,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:46,502 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:59:46,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:46,506 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2023-02-17 02:59:46,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:48,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:48,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934022359] [2023-02-17 02:59:48,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934022359] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:48,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [499233080] [2023-02-17 02:59:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:48,601 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:48,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:59:48,602 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:59:48,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-02-17 02:59:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:49,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:59:49,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:49,206 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:49,208 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:49,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_3978 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3978) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-17 02:59:49,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:49,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:49,259 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:59:49,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:49,264 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-17 02:59:49,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:49,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [499233080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:49,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:59:49,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-17 02:59:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240967755] [2023-02-17 02:59:49,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:49,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:59:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:59:49,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=71, Unknown=3, NotChecked=34, Total=132 [2023-02-17 02:59:49,280 INFO L87 Difference]: Start difference. First operand 427 states and 485 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2023-02-17 02:59:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:49,806 INFO L93 Difference]: Finished difference Result 531 states and 599 transitions. [2023-02-17 02:59:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:59:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 56 [2023-02-17 02:59:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:49,808 INFO L225 Difference]: With dead ends: 531 [2023-02-17 02:59:49,808 INFO L226 Difference]: Without dead ends: 531 [2023-02-17 02:59:49,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=30, Invalid=85, Unknown=3, NotChecked=38, Total=156 [2023-02-17 02:59:49,808 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 120 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:49,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 341 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 1 Unknown, 249 Unchecked, 0.5s Time] [2023-02-17 02:59:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-02-17 02:59:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2023-02-17 02:59:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 364 states have (on average 1.217032967032967) internal successors, (443), 393 states have internal predecessors, (443), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 459 transitions. [2023-02-17 02:59:49,816 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 459 transitions. Word has length 56 [2023-02-17 02:59:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:49,816 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 459 transitions. [2023-02-17 02:59:49,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) [2023-02-17 02:59:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 459 transitions. [2023-02-17 02:59:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 02:59:49,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:49,818 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:49,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:50,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:50,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:50,225 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1897094198, now seen corresponding path program 1 times [2023-02-17 02:59:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:50,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654360848] [2023-02-17 02:59:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:50,227 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:50,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-02-17 02:59:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:50,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:59:50,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:50,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:50,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-17 02:59:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:50,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:50,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654360848] [2023-02-17 02:59:50,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654360848] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:50,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:50,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:59:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72356965] [2023-02-17 02:59:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:50,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:59:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:59:50,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:59:50,525 INFO L87 Difference]: Start difference. First operand 407 states and 459 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-02-17 02:59:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:50,736 INFO L93 Difference]: Finished difference Result 445 states and 497 transitions. [2023-02-17 02:59:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:59:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 57 [2023-02-17 02:59:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:50,739 INFO L225 Difference]: With dead ends: 445 [2023-02-17 02:59:50,739 INFO L226 Difference]: Without dead ends: 445 [2023-02-17 02:59:50,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:59:50,740 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 151 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:50,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 353 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:59:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-17 02:59:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 409. [2023-02-17 02:59:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 366 states have (on average 1.215846994535519) internal successors, (445), 395 states have internal predecessors, (445), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 461 transitions. [2023-02-17 02:59:50,745 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 461 transitions. Word has length 57 [2023-02-17 02:59:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:50,745 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 461 transitions. [2023-02-17 02:59:50,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) [2023-02-17 02:59:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 461 transitions. [2023-02-17 02:59:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 02:59:50,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:50,745 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:50,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-02-17 02:59:50,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:50,970 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093746, now seen corresponding path program 1 times [2023-02-17 02:59:50,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:50,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452750114] [2023-02-17 02:59:50,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:50,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:50,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:50,972 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:50,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-02-17 02:59:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:51,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 02:59:51,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:51,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:51,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 02:59:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:51,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:51,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:51,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452750114] [2023-02-17 02:59:51,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452750114] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:51,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:59:51,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:59:51,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394273960] [2023-02-17 02:59:51,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:51,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:59:51,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:51,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:59:51,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:59:51,269 INFO L87 Difference]: Start difference. First operand 409 states and 461 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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) [2023-02-17 02:59:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:59:51,639 INFO L93 Difference]: Finished difference Result 427 states and 479 transitions. [2023-02-17 02:59:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:59:51,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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 57 [2023-02-17 02:59:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:59:51,640 INFO L225 Difference]: With dead ends: 427 [2023-02-17 02:59:51,640 INFO L226 Difference]: Without dead ends: 427 [2023-02-17 02:59:51,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 02:59:51,641 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 118 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 02:59:51,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 338 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 02:59:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-02-17 02:59:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 411. [2023-02-17 02:59:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 368 states have (on average 1.2173913043478262) internal successors, (448), 397 states have internal predecessors, (448), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 02:59:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 464 transitions. [2023-02-17 02:59:51,646 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 464 transitions. Word has length 57 [2023-02-17 02:59:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:59:51,646 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 464 transitions. [2023-02-17 02:59:51,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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) [2023-02-17 02:59:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 464 transitions. [2023-02-17 02:59:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 02:59:51,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:59:51,646 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:59:51,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2023-02-17 02:59:51,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:51,856 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 02:59:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:59:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093745, now seen corresponding path program 1 times [2023-02-17 02:59:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:59:51,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899249521] [2023-02-17 02:59:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:59:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:59:51,858 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:59:51,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-02-17 02:59:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:52,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 02:59:52,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:52,265 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:52,267 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:52,283 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:52,298 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:52,300 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32)) (v_ArrVal_4328 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4328) v_arrayElimCell_131 (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 02:59:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:52,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:52,325 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 02:59:52,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:52,330 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 02:59:52,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:52,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:52,391 INFO L350 Elim1Store]: Elim1 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 38 [2023-02-17 02:59:52,394 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 02:59:52,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:59:52,479 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-17 02:59:52,481 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-17 02:59:52,494 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-17 02:59:52,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-17 02:59:55,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:59:55,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899249521] [2023-02-17 02:59:55,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899249521] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:59:55,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1180909448] [2023-02-17 02:59:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:59:55,908 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:59:55,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:59:55,921 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:59:55,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-02-17 02:59:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:59:56,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 02:59:56,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:59:56,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:56,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 02:59:56,928 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 19 [2023-02-17 02:59:56,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 02:59:57,040 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 02:59:57,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 02:59:57,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-02-17 02:59:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:59:57,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:59:57,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1180909448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:59:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:59:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2023-02-17 02:59:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42577150] [2023-02-17 02:59:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:59:57,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:59:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:59:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:59:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=456, Unknown=2, NotChecked=42, Total=552 [2023-02-17 02:59:57,344 INFO L87 Difference]: Start difference. First operand 411 states and 464 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 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) [2023-02-17 03:00:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:00:00,045 INFO L93 Difference]: Finished difference Result 536 states and 605 transitions. [2023-02-17 03:00:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 03:00:00,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 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 57 [2023-02-17 03:00:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:00:00,048 INFO L225 Difference]: With dead ends: 536 [2023-02-17 03:00:00,048 INFO L226 Difference]: Without dead ends: 536 [2023-02-17 03:00:00,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=142, Invalid=982, Unknown=2, NotChecked=64, Total=1190 [2023-02-17 03:00:00,049 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 395 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-17 03:00:00,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 866 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-17 03:00:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-17 03:00:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 411. [2023-02-17 03:00:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 368 states have (on average 1.2119565217391304) internal successors, (446), 397 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 03:00:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 462 transitions. [2023-02-17 03:00:00,056 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 462 transitions. Word has length 57 [2023-02-17 03:00:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:00:00,057 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 462 transitions. [2023-02-17 03:00:00,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 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) [2023-02-17 03:00:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 462 transitions. [2023-02-17 03:00:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 03:00:00,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:00:00,057 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:00:00,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2023-02-17 03:00:00,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2023-02-17 03:00:00,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 03:00:00,474 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:00:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:00:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854146, now seen corresponding path program 1 times [2023-02-17 03:00:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:00:00,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460391514] [2023-02-17 03:00:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:00:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:00:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:00:00,476 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:00:00,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-02-17 03:00:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:00:01,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:00:01,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:00:01,056 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-17 03:00:01,078 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:01,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:01,124 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 64 [2023-02-17 03:00:01,127 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 36 [2023-02-17 03:00:01,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:01,161 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 64 [2023-02-17 03:00:01,165 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 36 [2023-02-17 03:00:01,190 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 21 [2023-02-17 03:00:01,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:01,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:01,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 124 [2023-02-17 03:00:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 03:00:02,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:00:02,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:00:02,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460391514] [2023-02-17 03:00:02,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460391514] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:00:02,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [950239662] [2023-02-17 03:00:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:00:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:00:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:00:02,558 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:00:02,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2023-02-17 03:00:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:00:03,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:00:03,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:00:03,510 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-17 03:00:03,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:03,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:03,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:03,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:03,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 68 [2023-02-17 03:00:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:00:04,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:00:04,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [950239662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:00:04,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:00:04,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2023-02-17 03:00:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535142981] [2023-02-17 03:00:04,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:00:04,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 03:00:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:00:04,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 03:00:04,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=252, Unknown=1, NotChecked=0, Total=306 [2023-02-17 03:00:04,700 INFO L87 Difference]: Start difference. First operand 411 states and 462 transitions. Second operand has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:00:14,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:00:18,182 INFO L93 Difference]: Finished difference Result 514 states and 574 transitions. [2023-02-17 03:00:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 03:00:18,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2023-02-17 03:00:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:00:18,185 INFO L225 Difference]: With dead ends: 514 [2023-02-17 03:00:18,185 INFO L226 Difference]: Without dead ends: 514 [2023-02-17 03:00:18,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=129, Invalid=570, Unknown=3, NotChecked=0, Total=702 [2023-02-17 03:00:18,185 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 502 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 32 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:00:18,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 503 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 591 Invalid, 63 Unknown, 0 Unchecked, 8.0s Time] [2023-02-17 03:00:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-02-17 03:00:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 441. [2023-02-17 03:00:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.2045454545454546) internal successors, (477), 426 states have internal predecessors, (477), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (16), 10 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-17 03:00:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 497 transitions. [2023-02-17 03:00:18,190 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 497 transitions. Word has length 57 [2023-02-17 03:00:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:00:18,191 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 497 transitions. [2023-02-17 03:00:18,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:00:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 497 transitions. [2023-02-17 03:00:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 03:00:18,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:00:18,191 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:00:18,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2023-02-17 03:00:18,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2023-02-17 03:00:18,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:00:18,604 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:00:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:00:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854147, now seen corresponding path program 1 times [2023-02-17 03:00:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:00:18,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036886841] [2023-02-17 03:00:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:00:18,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:00:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:00:18,614 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:00:18,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-02-17 03:00:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:00:19,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:00:19,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:00:19,240 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:19,243 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:19,252 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:19,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:19,256 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 03:00:19,272 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-17 03:00:19,275 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-17 03:00:19,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:19,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:19,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:19,374 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 18 treesize of output 82 [2023-02-17 03:00:19,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:19,384 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 03:00:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:00:19,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:00:19,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:00:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036886841] [2023-02-17 03:00:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036886841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:00:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180833398] [2023-02-17 03:00:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:00:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:00:19,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:00:19,610 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:00:19,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-02-17 03:00:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:00:20,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:00:20,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:00:20,610 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:20,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:20,646 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:20,732 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:00:27,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:27,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:27,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:00:27,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:00:27,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 73 [2023-02-17 03:00:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:00:27,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:00:30,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [180833398] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:00:30,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:00:30,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-17 03:00:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406082368] [2023-02-17 03:00:30,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:00:30,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 03:00:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:00:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 03:00:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=280, Unknown=11, NotChecked=0, Total=342 [2023-02-17 03:00:30,191 INFO L87 Difference]: Start difference. First operand 441 states and 497 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 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) [2023-02-17 03:00:34,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:36,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:41,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:48,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:50,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:55,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:00:59,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:02,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:04,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:06,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:07,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:09,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:11,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:14,990 INFO L93 Difference]: Finished difference Result 797 states and 880 transitions. [2023-02-17 03:01:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 03:01:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2023-02-17 03:01:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:14,994 INFO L225 Difference]: With dead ends: 797 [2023-02-17 03:01:14,994 INFO L226 Difference]: Without dead ends: 797 [2023-02-17 03:01:14,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=181, Invalid=711, Unknown=38, NotChecked=0, Total=930 [2023-02-17 03:01:14,995 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 898 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 35 mSolverCounterUnsat, 332 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 332 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:14,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 767 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 832 Invalid, 332 Unknown, 0 Unchecked, 39.0s Time] [2023-02-17 03:01:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2023-02-17 03:01:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 480. [2023-02-17 03:01:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 434 states have (on average 1.195852534562212) internal successors, (519), 463 states have internal predecessors, (519), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-17 03:01:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 537 transitions. [2023-02-17 03:01:15,000 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 537 transitions. Word has length 57 [2023-02-17 03:01:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:15,000 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 537 transitions. [2023-02-17 03:01:15,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 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) [2023-02-17 03:01:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 537 transitions. [2023-02-17 03:01:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 03:01:15,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:15,007 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:15,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Ended with exit code 0 [2023-02-17 03:01:15,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Ended with exit code 0 [2023-02-17 03:01:15,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:15,416 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2094859878, now seen corresponding path program 1 times [2023-02-17 03:01:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:15,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328736900] [2023-02-17 03:01:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:15,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:15,419 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2023-02-17 03:01:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:16,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:01:16,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:16,067 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:16,070 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:16,102 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|))) is different from true [2023-02-17 03:01:16,130 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) create_data_~nextData~0.base (_ bv16 32))))) is different from true [2023-02-17 03:01:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:16,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:16,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:16,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 03:01:16,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:16,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 03:01:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 03:01:16,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:01:16,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:01:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328736900] [2023-02-17 03:01:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328736900] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:01:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2022026372] [2023-02-17 03:01:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:16,273 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:01:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:01:16,274 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:01:16,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2023-02-17 03:01:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:17,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:01:17,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:17,300 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:17,303 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:17,389 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_5658 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5657 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5658) |create_data_#t~malloc7.base| v_ArrVal_5657) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) is different from true [2023-02-17 03:01:17,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:17,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:17,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:17,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:17,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 03:01:17,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:17,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 03:01:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 03:01:17,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:01:21,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2022026372] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:01:21,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:01:21,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-17 03:01:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626331180] [2023-02-17 03:01:21,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:01:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:01:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:01:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:01:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=87, Unknown=5, NotChecked=60, Total=182 [2023-02-17 03:01:21,513 INFO L87 Difference]: Start difference. First operand 480 states and 537 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:01:21,647 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|))) (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_5457 (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |c_create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |c_create_data_#t~malloc7.base|))))) is different from true [2023-02-17 03:01:21,654 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|))) (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_5658 (_ BitVec 32)) (v_ArrVal_5657 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5658) |create_data_#t~malloc7.base| v_ArrVal_5657) |c_#length|))))) is different from true [2023-02-17 03:01:21,861 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) create_data_~nextData~0.base (_ bv16 32))))) (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_5658 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5657 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5658) |create_data_#t~malloc7.base| v_ArrVal_5657) create_data_~nextData~0.base (_ bv16 32)) |c_#length|)))) is different from true [2023-02-17 03:01:24,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:01:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:25,044 INFO L93 Difference]: Finished difference Result 689 states and 771 transitions. [2023-02-17 03:01:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:01:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2023-02-17 03:01:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:25,046 INFO L225 Difference]: With dead ends: 689 [2023-02-17 03:01:25,046 INFO L226 Difference]: Without dead ends: 689 [2023-02-17 03:01:25,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=48, Invalid=124, Unknown=8, NotChecked=162, Total=342 [2023-02-17 03:01:25,047 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 191 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 642 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:25,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 552 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 28 Unknown, 642 Unchecked, 3.4s Time] [2023-02-17 03:01:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-02-17 03:01:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 486. [2023-02-17 03:01:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 440 states have (on average 1.1977272727272728) internal successors, (527), 469 states have internal predecessors, (527), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-17 03:01:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 545 transitions. [2023-02-17 03:01:25,053 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 545 transitions. Word has length 59 [2023-02-17 03:01:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:25,054 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 545 transitions. [2023-02-17 03:01:25,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:01:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 545 transitions. [2023-02-17 03:01:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-17 03:01:25,054 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:25,054 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:25,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:25,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:25,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 03:01:25,470 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1611932791, now seen corresponding path program 1 times [2023-02-17 03:01:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:25,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005183835] [2023-02-17 03:01:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:25,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:25,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:25,472 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:25,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2023-02-17 03:01:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:26,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 03:01:26,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:26,013 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:26,018 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:26,048 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:26,077 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:26,082 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5786 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5786) v_arrayElimCell_175 (_ bv80 32)) |c_#length|))) is different from true [2023-02-17 03:01:26,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:26,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:26,102 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 03:01:26,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:26,111 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 03:01:26,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:26,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:26,234 INFO L350 Elim1Store]: Elim1 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 38 [2023-02-17 03:01:26,238 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 03:01:26,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:01:26,417 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-17 03:01:26,422 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-17 03:01:26,447 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-17 03:01:26,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-17 03:01:33,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:01:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005183835] [2023-02-17 03:01:33,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005183835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:01:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366058396] [2023-02-17 03:01:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:01:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:01:33,496 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:01:33,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-02-17 03:01:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:34,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 03:01:34,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:34,426 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:34,431 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:34,471 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_5915 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5915) |create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-17 03:01:34,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:34,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:34,494 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 03:01:34,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:34,505 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 03:01:34,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:34,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:35,270 INFO L350 Elim1Store]: Elim1 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 38 [2023-02-17 03:01:35,278 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:35,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:01:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [366058396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:01:35,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:01:35,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-17 03:01:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218991225] [2023-02-17 03:01:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:01:35,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:01:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:01:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:01:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=5, NotChecked=66, Total=380 [2023-02-17 03:01:35,313 INFO L87 Difference]: Start difference. First operand 486 states and 545 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 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) [2023-02-17 03:01:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:36,860 INFO L93 Difference]: Finished difference Result 776 states and 881 transitions. [2023-02-17 03:01:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:01:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 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 61 [2023-02-17 03:01:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:36,864 INFO L225 Difference]: With dead ends: 776 [2023-02-17 03:01:36,865 INFO L226 Difference]: Without dead ends: 776 [2023-02-17 03:01:36,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=88, Invalid=335, Unknown=5, NotChecked=78, Total=506 [2023-02-17 03:01:36,865 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 328 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:36,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 555 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 454 Invalid, 1 Unknown, 272 Unchecked, 1.3s Time] [2023-02-17 03:01:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-02-17 03:01:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 601. [2023-02-17 03:01:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 547 states have (on average 1.2084095063985374) internal successors, (661), 577 states have internal predecessors, (661), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 19 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-17 03:01:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 705 transitions. [2023-02-17 03:01:36,873 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 705 transitions. Word has length 61 [2023-02-17 03:01:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:36,873 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 705 transitions. [2023-02-17 03:01:36,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 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) [2023-02-17 03:01:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 705 transitions. [2023-02-17 03:01:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 03:01:36,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:36,874 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:36,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:37,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:37,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 03:01:37,277 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash 939726753, now seen corresponding path program 1 times [2023-02-17 03:01:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809654122] [2023-02-17 03:01:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:37,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:37,283 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:37,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2023-02-17 03:01:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:37,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:01:37,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:37,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:37,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:01:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:37,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:01:37,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:01:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809654122] [2023-02-17 03:01:37,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809654122] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:01:37,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:01:37,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:01:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291744358] [2023-02-17 03:01:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:01:37,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:01:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:01:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:01:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:01:37,724 INFO L87 Difference]: Start difference. First operand 601 states and 705 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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) [2023-02-17 03:01:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:38,420 INFO L93 Difference]: Finished difference Result 616 states and 719 transitions. [2023-02-17 03:01:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:01:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 64 [2023-02-17 03:01:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:38,443 INFO L225 Difference]: With dead ends: 616 [2023-02-17 03:01:38,443 INFO L226 Difference]: Without dead ends: 616 [2023-02-17 03:01:38,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:01:38,444 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 127 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:38,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 333 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 03:01:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-02-17 03:01:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2023-02-17 03:01:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 550 states have (on average 1.209090909090909) internal successors, (665), 580 states have internal predecessors, (665), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 19 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-17 03:01:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 709 transitions. [2023-02-17 03:01:38,452 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 709 transitions. Word has length 64 [2023-02-17 03:01:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 709 transitions. [2023-02-17 03:01:38,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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) [2023-02-17 03:01:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 709 transitions. [2023-02-17 03:01:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-17 03:01:38,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:38,453 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:38,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:38,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:38,654 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 939726754, now seen corresponding path program 1 times [2023-02-17 03:01:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:38,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784238336] [2023-02-17 03:01:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:38,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:38,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:38,656 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:38,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2023-02-17 03:01:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:39,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:01:39,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:39,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:39,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:39,084 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-17 03:01:39,098 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:39,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:01:39,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:01:39,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784238336] [2023-02-17 03:01:39,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784238336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:01:39,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:01:39,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:01:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400705433] [2023-02-17 03:01:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:01:39,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:01:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:01:39,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:01:39,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:01:39,109 INFO L87 Difference]: Start difference. First operand 604 states and 709 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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) [2023-02-17 03:01:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:39,755 INFO L93 Difference]: Finished difference Result 632 states and 735 transitions. [2023-02-17 03:01:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:01:39,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 64 [2023-02-17 03:01:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:39,758 INFO L225 Difference]: With dead ends: 632 [2023-02-17 03:01:39,758 INFO L226 Difference]: Without dead ends: 632 [2023-02-17 03:01:39,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:01:39,758 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 156 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:39,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 327 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 03:01:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-02-17 03:01:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 604. [2023-02-17 03:01:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 550 states have (on average 1.2072727272727273) internal successors, (664), 580 states have internal predecessors, (664), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 19 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-17 03:01:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 708 transitions. [2023-02-17 03:01:39,765 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 708 transitions. Word has length 64 [2023-02-17 03:01:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:39,765 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 708 transitions. [2023-02-17 03:01:39,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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) [2023-02-17 03:01:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 708 transitions. [2023-02-17 03:01:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 03:01:39,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:39,766 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:39,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:39,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:39,977 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:39,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash 504851823, now seen corresponding path program 1 times [2023-02-17 03:01:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:39,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664591150] [2023-02-17 03:01:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:39,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:39,979 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:39,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2023-02-17 03:01:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:40,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 03:01:40,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:40,572 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:40,577 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:40,602 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:40,625 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:40,629 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_193 (_ BitVec 32)) (v_ArrVal_6272 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6272) v_arrayElimCell_193 (_ bv80 32))))) is different from true [2023-02-17 03:01:40,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:40,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:40,649 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 03:01:40,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:40,657 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 03:01:40,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:40,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:40,754 INFO L350 Elim1Store]: Elim1 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 38 [2023-02-17 03:01:40,759 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 03:01:40,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:01:40,911 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-17 03:01:40,914 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-17 03:01:40,931 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-17 03:01:40,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-17 03:01:46,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:01:46,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664591150] [2023-02-17 03:01:46,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664591150] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:01:46,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [780759692] [2023-02-17 03:01:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:46,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:01:46,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:01:46,916 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:01:46,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2023-02-17 03:01:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:47,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 03:01:47,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:47,937 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:47,944 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:48,004 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_6402 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6402) |create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-17 03:01:48,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:01:48,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:48,032 INFO L350 Elim1Store]: Elim1 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 47 [2023-02-17 03:01:48,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:48,043 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 15 [2023-02-17 03:01:48,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:48,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:48,688 INFO L350 Elim1Store]: Elim1 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 38 [2023-02-17 03:01:48,691 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:48,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:01:48,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [780759692] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:01:48,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:01:48,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-17 03:01:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324787612] [2023-02-17 03:01:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:01:48,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:01:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:01:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:01:48,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=254, Unknown=4, NotChecked=66, Total=380 [2023-02-17 03:01:48,728 INFO L87 Difference]: Start difference. First operand 604 states and 708 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 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) [2023-02-17 03:01:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:50,983 INFO L93 Difference]: Finished difference Result 809 states and 939 transitions. [2023-02-17 03:01:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:01:50,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 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 65 [2023-02-17 03:01:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:50,987 INFO L225 Difference]: With dead ends: 809 [2023-02-17 03:01:50,987 INFO L226 Difference]: Without dead ends: 809 [2023-02-17 03:01:50,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=88, Invalid=336, Unknown=4, NotChecked=78, Total=506 [2023-02-17 03:01:50,987 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 249 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:50,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 671 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 598 Invalid, 4 Unknown, 299 Unchecked, 2.0s Time] [2023-02-17 03:01:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2023-02-17 03:01:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 638. [2023-02-17 03:01:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 582 states have (on average 1.2010309278350515) internal successors, (699), 612 states have internal predecessors, (699), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (40), 21 states have call predecessors, (40), 8 states have call successors, (40) [2023-02-17 03:01:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 747 transitions. [2023-02-17 03:01:51,000 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 747 transitions. Word has length 65 [2023-02-17 03:01:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:51,001 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 747 transitions. [2023-02-17 03:01:51,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 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) [2023-02-17 03:01:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 747 transitions. [2023-02-17 03:01:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 03:01:51,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:51,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:51,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Ended with exit code 0 [2023-02-17 03:01:51,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (61)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:51,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 03:01:51,424 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -665539789, now seen corresponding path program 1 times [2023-02-17 03:01:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:51,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111932547] [2023-02-17 03:01:51,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:51,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:51,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:51,437 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:51,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2023-02-17 03:01:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:51,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 03:01:52,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:52,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:52,022 INFO L350 Elim1Store]: Elim1 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 25 [2023-02-17 03:01:52,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:52,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:52,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 59 [2023-02-17 03:01:52,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:52,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 76 treesize of output 126 [2023-02-17 03:01:52,153 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 32 [2023-02-17 03:01:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:52,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:01:52,297 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-17 03:01:52,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:52,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 178 [2023-02-17 03:01:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:52,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:01:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111932547] [2023-02-17 03:01:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111932547] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:01:52,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:01:52,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-02-17 03:01:52,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608543577] [2023-02-17 03:01:52,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:01:52,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 03:01:52,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:01:52,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 03:01:52,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-17 03:01:52,429 INFO L87 Difference]: Start difference. First operand 638 states and 747 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:01:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:01:54,010 INFO L93 Difference]: Finished difference Result 649 states and 760 transitions. [2023-02-17 03:01:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:01:54,012 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-02-17 03:01:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:01:54,013 INFO L225 Difference]: With dead ends: 649 [2023-02-17 03:01:54,013 INFO L226 Difference]: Without dead ends: 649 [2023-02-17 03:01:54,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2023-02-17 03:01:54,014 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 212 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:01:54,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 633 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-17 03:01:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-02-17 03:01:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 637. [2023-02-17 03:01:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 582 states have (on average 1.1941580756013745) internal successors, (695), 611 states have internal predecessors, (695), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (40), 21 states have call predecessors, (40), 8 states have call successors, (40) [2023-02-17 03:01:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 743 transitions. [2023-02-17 03:01:54,029 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 743 transitions. Word has length 65 [2023-02-17 03:01:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:01:54,029 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 743 transitions. [2023-02-17 03:01:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:01:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 743 transitions. [2023-02-17 03:01:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 03:01:54,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:01:54,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:01:54,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Forceful destruction successful, exit code 0 [2023-02-17 03:01:54,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:54,243 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 03:01:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:01:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -665539788, now seen corresponding path program 1 times [2023-02-17 03:01:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:01:54,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131202606] [2023-02-17 03:01:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:01:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:01:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:01:54,246 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:01:54,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2023-02-17 03:01:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:01:54,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 03:01:54,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:01:54,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:54,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:01:54,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:54,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2023-02-17 03:01:54,820 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-17 03:01:54,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:54,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 [2023-02-17 03:01:54,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:54,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 48 [2023-02-17 03:01:54,939 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 15 [2023-02-17 03:01:54,945 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:01:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:01:54,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:01:55,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-02-17 03:01:55,462 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 28 [2023-02-17 03:01:55,470 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 62 [2023-02-17 03:01:55,475 INFO L350 Elim1Store]: Elim1 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 94 [2023-02-17 03:01:56,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:56,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 33 select indices, 33 select index equivalence classes, 0 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 528 case distinctions, treesize of input 2265 treesize of output 6337 [2023-02-17 03:01:57,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:01:57,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 59 select indices, 59 select index equivalence classes, 0 disjoint index pairs (out of 1711 index pairs), introduced 59 new quantified variables, introduced 1711 case distinctions, treesize of input 2113 treesize of output 15683