./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:57:39,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:57:39,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:57:39,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:57:39,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:57:39,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:57:39,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:57:39,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:57:39,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:57:39,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:57:39,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:57:39,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:57:39,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:57:39,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:57:39,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:57:39,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:57:39,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:57:39,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:57:39,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:57:39,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:57:39,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:57:39,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:57:39,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:57:39,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:57:39,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:57:39,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:57:39,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:57:39,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:57:39,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:57:39,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:57:39,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:57:39,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:57:39,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:57:39,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:57:39,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:57:39,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:57:39,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:57:39,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:57:39,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:57:39,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:57:39,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:57:39,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:57:39,497 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:57:39,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:57:39,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:57:39,498 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:57:39,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:57:39,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:57:39,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:57:39,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:57:39,500 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:57:39,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:57:39,501 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:57:39,501 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:57:39,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:57:39,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:57:39,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:57:39,501 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:57:39,502 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:57:39,502 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:57:39,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:57:39,502 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:57:39,502 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:57:39,502 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:57:39,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:57:39,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:57:39,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:57:39,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:57:39,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:57:39,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:57:39,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:57:39,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:57:39,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:57:39,504 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:57:39,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:57:39,505 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:57:39,505 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2023-02-14 01:57:39,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:57:39,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:57:39,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:57:39,719 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:57:39,719 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:57:39,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2023-02-14 01:57:40,784 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:57:41,015 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:57:41,016 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2023-02-14 01:57:41,027 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8845274e/18f0171a612a486e8006da53f512d47e/FLAGefbfa598e [2023-02-14 01:57:41,037 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8845274e/18f0171a612a486e8006da53f512d47e [2023-02-14 01:57:41,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:57:41,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:57:41,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:41,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:57:41,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:57:41,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:41" (1/1) ... [2023-02-14 01:57:41,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0be74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:41, skipping insertion in model container [2023-02-14 01:57:41,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:41" (1/1) ... [2023-02-14 01:57:41,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:57:41,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:57:41,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:41,290 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-14 01:57:41,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3144c872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:41, skipping insertion in model container [2023-02-14 01:57:41,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:41,291 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-14 01:57:41,293 INFO L158 Benchmark]: Toolchain (without parser) took 252.23ms. Allocated memory is still 132.1MB. Free memory was 85.6MB in the beginning and 71.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-14 01:57:41,293 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 78.0MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 01:57:41,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.68ms. Allocated memory is still 132.1MB. Free memory was 85.6MB in the beginning and 71.9MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-14 01:57:41,294 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 78.1MB in the beginning and 78.0MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.68ms. Allocated memory is still 132.1MB. Free memory was 85.6MB in the beginning and 71.9MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:57:43,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:57:43,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:57:43,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:57:43,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:57:43,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:57:43,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:57:43,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:57:43,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:57:43,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:57:43,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:57:43,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:57:43,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:57:43,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:57:43,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:57:43,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:57:43,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:57:43,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:57:43,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:57:43,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:57:43,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:57:43,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:57:43,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:57:43,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:57:43,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:57:43,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:57:43,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:57:43,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:57:43,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:57:43,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:57:43,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:57:43,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:57:43,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:57:43,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:57:43,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:57:43,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:57:43,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:57:43,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:57:43,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:57:43,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:57:43,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:57:43,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 01:57:43,162 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:57:43,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:57:43,162 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:57:43,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:57:43,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:57:43,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:57:43,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:57:43,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:57:43,165 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:57:43,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:57:43,165 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:57:43,166 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:57:43,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:57:43,167 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:57:43,167 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 01:57:43,167 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 01:57:43,167 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:57:43,167 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:57:43,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:57:43,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:57:43,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:57:43,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:57:43,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:57:43,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:57:43,168 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 01:57:43,169 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:43,169 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:57:43,169 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:57:43,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:57:43,169 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 01:57:43,170 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:57:43,170 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2023-02-14 01:57:43,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:57:43,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:57:43,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:57:43,439 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:57:43,440 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:57:43,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2023-02-14 01:57:44,363 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:57:44,685 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:57:44,685 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2023-02-14 01:57:44,698 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597240e91/f98bfc3ea76a4371a10ee89612cc935c/FLAG81bb4248d [2023-02-14 01:57:44,708 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597240e91/f98bfc3ea76a4371a10ee89612cc935c [2023-02-14 01:57:44,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:57:44,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:57:44,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:44,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:57:44,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:57:44,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:44" (1/1) ... [2023-02-14 01:57:44,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6c06ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:44, skipping insertion in model container [2023-02-14 01:57:44,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:44" (1/1) ... [2023-02-14 01:57:44,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:57:44,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:57:45,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:45,093 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-14 01:57:45,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:57:45,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:45,147 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:57:45,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:45,224 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:57:45,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45 WrapperNode [2023-02-14 01:57:45,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:45,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:57:45,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:57:45,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:57:45,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,262 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 57 [2023-02-14 01:57:45,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:57:45,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:57:45,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:57:45,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:57:45,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,280 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:57:45,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:57:45,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:57:45,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:57:45,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (1/1) ... [2023-02-14 01:57:45,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:57:45,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:57:45,316 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-14 01:57:45,331 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-14 01:57:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-14 01:57:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-14 01:57:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-14 01:57:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-14 01:57:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-14 01:57:45,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-14 01:57:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-02-14 01:57:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 01:57:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2023-02-14 01:57:45,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2023-02-14 01:57:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:57:45,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:57:45,443 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:57:45,444 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:57:45,775 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:57:45,779 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:57:45,779 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 01:57:45,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:57:45 BoogieIcfgContainer [2023-02-14 01:57:45,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:57:45,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:57:45,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:57:45,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:57:45,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:57:44" (1/3) ... [2023-02-14 01:57:45,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5054745d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:57:45, skipping insertion in model container [2023-02-14 01:57:45,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:45" (2/3) ... [2023-02-14 01:57:45,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5054745d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:57:45, skipping insertion in model container [2023-02-14 01:57:45,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:57:45" (3/3) ... [2023-02-14 01:57:45,790 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2023-02-14 01:57:45,801 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:57:45,802 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-02-14 01:57:45,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:57:45,847 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;@2aa99e93, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:57:45,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-02-14 01:57:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 45 states have (on average 1.8) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:57:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:57:45,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:45,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:45,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:57:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:45,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2002543009, now seen corresponding path program 1 times [2023-02-14 01:57:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:45,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770253934] [2023-02-14 01:57:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:45,872 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-14 01:57:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:45,875 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-14 01:57:45,922 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-14 01:57:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:45,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:57:45,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:46,161 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:57:46,162 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 14 treesize of output 20 [2023-02-14 01:57:46,227 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-14 01:57:46,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:46,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:46,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770253934] [2023-02-14 01:57:46,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770253934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:46,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:46,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529998900] [2023-02-14 01:57:46,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:46,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:57:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:57:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2023-02-14 01:57:46,262 INFO L87 Difference]: Start difference. First operand has 88 states, 45 states have (on average 1.8) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:47,156 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2023-02-14 01:57:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:57:47,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-14 01:57:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:47,167 INFO L225 Difference]: With dead ends: 129 [2023-02-14 01:57:47,168 INFO L226 Difference]: Without dead ends: 125 [2023-02-14 01:57:47,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=70, Unknown=1, NotChecked=0, Total=110 [2023-02-14 01:57:47,176 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 170 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 17 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:47,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 134 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 287 Invalid, 30 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:57:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-14 01:57:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 84. [2023-02-14 01:57:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:57:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-14 01:57:47,223 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 12 [2023-02-14 01:57:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:47,223 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-14 01:57:47,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-14 01:57:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:57:47,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:47,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:47,239 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-14 01:57:47,431 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-14 01:57:47,431 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:57:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2002543010, now seen corresponding path program 1 times [2023-02-14 01:57:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:47,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982275073] [2023-02-14 01:57:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:47,433 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-14 01:57:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:47,434 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-14 01:57:47,436 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-14 01:57:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:47,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:57:47,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:49,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:49,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-14 01:57:49,710 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-14 01:57:49,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:49,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:49,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982275073] [2023-02-14 01:57:49,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982275073] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:49,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:49,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:57:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701101853] [2023-02-14 01:57:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:49,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:57:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:49,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:57:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=40, Unknown=2, NotChecked=0, Total=56 [2023-02-14 01:57:49,712 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:56,395 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2023-02-14 01:57:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:57:56,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-14 01:57:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:56,397 INFO L225 Difference]: With dead ends: 123 [2023-02-14 01:57:56,397 INFO L226 Difference]: Without dead ends: 123 [2023-02-14 01:57:56,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=63, Invalid=143, Unknown=4, NotChecked=0, Total=210 [2023-02-14 01:57:56,398 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 252 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 42 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:56,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 100 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 298 Invalid, 12 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:57:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-14 01:57:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 82. [2023-02-14 01:57:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:57:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2023-02-14 01:57:56,403 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 12 [2023-02-14 01:57:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:56,403 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2023-02-14 01:57:56,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2023-02-14 01:57:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:57:56,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:56,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:56,419 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 (3)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:56,604 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-14 01:57:56,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:57:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash 663113707, now seen corresponding path program 1 times [2023-02-14 01:57:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:56,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927183168] [2023-02-14 01:57:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:56,606 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-14 01:57:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:56,607 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-14 01:57:56,609 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-14 01:57:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:56,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 01:57:56,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:56,698 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-14 01:57:56,727 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-14 01:57:56,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:56,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927183168] [2023-02-14 01:57:56,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927183168] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:56,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:56,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:57:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117246282] [2023-02-14 01:57:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:56,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:57:56,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:57:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:57:56,730 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:57,079 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2023-02-14 01:57:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:57:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-14 01:57:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:57,081 INFO L225 Difference]: With dead ends: 115 [2023-02-14 01:57:57,081 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 01:57:57,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:57:57,082 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 66 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 350 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-14 01:57:57,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 350 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:57:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 01:57:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2023-02-14 01:57:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 71 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:57:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-14 01:57:57,092 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 15 [2023-02-14 01:57:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:57,093 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-14 01:57:57,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-14 01:57:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:57:57,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:57,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:57,101 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 (4)] Ended with exit code 0 [2023-02-14 01:57:57,301 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-14 01:57:57,301 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:57:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash 663113708, now seen corresponding path program 1 times [2023-02-14 01:57:57,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:57,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234631836] [2023-02-14 01:57:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:57,302 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-14 01:57:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:57,303 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-14 01:57:57,305 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-14 01:57:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:57,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 01:57:57,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:59,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:59,546 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-14 01:57:59,655 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-14 01:57:59,660 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-14 01:57:59,727 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-14 01:57:59,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:59,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:59,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234631836] [2023-02-14 01:57:59,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234631836] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:59,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:59,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 01:57:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417508812] [2023-02-14 01:57:59,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:57:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:57:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=88, Unknown=2, NotChecked=0, Total=110 [2023-02-14 01:57:59,728 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:04,718 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2023-02-14 01:58:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:58:04,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-14 01:58:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:04,719 INFO L225 Difference]: With dead ends: 111 [2023-02-14 01:58:04,719 INFO L226 Difference]: Without dead ends: 111 [2023-02-14 01:58:04,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=100, Invalid=318, Unknown=2, NotChecked=0, Total=420 [2023-02-14 01:58:04,720 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 32 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:04,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 275 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 421 Invalid, 3 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 01:58:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-14 01:58:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2023-02-14 01:58:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 70 states have internal predecessors, (72), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 01:58:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2023-02-14 01:58:04,725 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 15 [2023-02-14 01:58:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:04,725 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2023-02-14 01:58:04,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2023-02-14 01:58:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:58:04,725 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:04,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:04,732 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-14 01:58:04,928 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-14 01:58:04,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1949585109, now seen corresponding path program 1 times [2023-02-14 01:58:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:04,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911543588] [2023-02-14 01:58:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:04,929 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-14 01:58:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:04,930 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-14 01:58:04,932 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-14 01:58:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:04,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:58:04,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:05,011 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-14 01:58:05,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:05,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:05,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911543588] [2023-02-14 01:58:05,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911543588] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:05,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:05,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:58:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130225101] [2023-02-14 01:58:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:05,014 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 01:58:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:05,032 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2023-02-14 01:58:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:58:05,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2023-02-14 01:58:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:05,035 INFO L225 Difference]: With dead ends: 110 [2023-02-14 01:58:05,035 INFO L226 Difference]: Without dead ends: 110 [2023-02-14 01:58:05,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:05,039 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 24 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:05,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:58:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-14 01:58:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2023-02-14 01:58:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-14 01:58:05,051 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2023-02-14 01:58:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:05,051 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-14 01:58:05,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 01:58:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-14 01:58:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:58:05,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:05,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:05,059 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-14 01:58:05,259 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-14 01:58:05,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash 142130646, now seen corresponding path program 1 times [2023-02-14 01:58:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:05,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268106873] [2023-02-14 01:58:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:05,261 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-14 01:58:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:05,262 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-14 01:58:05,263 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-14 01:58:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:05,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:58:05,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:05,471 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-14 01:58:05,477 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-14 01:58:05,509 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-14 01:58:05,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:05,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:05,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268106873] [2023-02-14 01:58:05,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268106873] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:05,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:05,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:05,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721665456] [2023-02-14 01:58:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:05,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:58:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:05,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:58:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:05,510 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-14 01:58:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:05,858 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2023-02-14 01:58:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:58:05,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2023-02-14 01:58:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:05,859 INFO L225 Difference]: With dead ends: 109 [2023-02-14 01:58:05,859 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 01:58:05,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:58:05,860 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:05,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 236 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:58:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 01:58:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2023-02-14 01:58:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 78 states have internal predecessors, (82), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2023-02-14 01:58:05,864 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 13 [2023-02-14 01:58:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:05,864 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2023-02-14 01:58:05,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-14 01:58:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2023-02-14 01:58:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:58:05,864 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:05,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:05,883 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-14 01:58:06,071 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-14 01:58:06,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:06,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 142130645, now seen corresponding path program 1 times [2023-02-14 01:58:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:06,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788947411] [2023-02-14 01:58:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:06,073 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-14 01:58:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:06,076 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-14 01:58:06,078 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-14 01:58:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:06,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:58:06,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:06,223 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-14 01:58:06,242 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-14 01:58:06,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:06,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:06,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788947411] [2023-02-14 01:58:06,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788947411] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:06,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:06,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:06,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640023527] [2023-02-14 01:58:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:06,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:58:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:58:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:06,248 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-14 01:58:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:06,639 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2023-02-14 01:58:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:58:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2023-02-14 01:58:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:06,640 INFO L225 Difference]: With dead ends: 104 [2023-02-14 01:58:06,640 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 01:58:06,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:58:06,641 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 39 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:06,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 182 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:58:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 01:58:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2023-02-14 01:58:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.528301886792453) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2023-02-14 01:58:06,648 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 13 [2023-02-14 01:58:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:06,649 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2023-02-14 01:58:06,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-14 01:58:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2023-02-14 01:58:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:58:06,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:06,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:06,662 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 (8)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:06,853 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-14 01:58:06,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:06,854 INFO L85 PathProgramCache]: Analyzing trace with hash -918311498, now seen corresponding path program 1 times [2023-02-14 01:58:06,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:06,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466284679] [2023-02-14 01:58:06,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:06,854 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-14 01:58:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:06,856 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-14 01:58:06,856 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-14 01:58:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:06,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:58:06,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:06,910 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 7 [2023-02-14 01:58:06,974 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-14 01:58:06,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:06,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:06,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466284679] [2023-02-14 01:58:06,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466284679] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:06,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:06,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 01:58:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216540836] [2023-02-14 01:58:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:06,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 01:58:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 01:58:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:58:06,976 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:07,324 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2023-02-14 01:58:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:58:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-14 01:58:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:07,325 INFO L225 Difference]: With dead ends: 127 [2023-02-14 01:58:07,326 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 01:58:07,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:58:07,326 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 47 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:07,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 419 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:58:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 01:58:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2023-02-14 01:58:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.492063492063492) internal successors, (94), 88 states have internal predecessors, (94), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 01:58:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2023-02-14 01:58:07,330 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 16 [2023-02-14 01:58:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:07,330 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2023-02-14 01:58:07,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2023-02-14 01:58:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:58:07,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:07,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:07,349 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-14 01:58:07,538 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-14 01:58:07,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:07,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:07,539 INFO L85 PathProgramCache]: Analyzing trace with hash -918311497, now seen corresponding path program 1 times [2023-02-14 01:58:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:07,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854356734] [2023-02-14 01:58:07,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:07,540 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-14 01:58:07,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:07,541 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-14 01:58:07,550 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-14 01:58:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:07,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:58:07,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:07,621 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-14 01:58:07,733 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-14 01:58:07,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:07,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:07,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854356734] [2023-02-14 01:58:07,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854356734] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:07,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 01:58:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119540595] [2023-02-14 01:58:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:07,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:58:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:58:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:58:07,735 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:08,166 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2023-02-14 01:58:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:58:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-14 01:58:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:08,169 INFO L225 Difference]: With dead ends: 130 [2023-02-14 01:58:08,169 INFO L226 Difference]: Without dead ends: 130 [2023-02-14 01:58:08,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:58:08,169 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:08,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 503 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:58:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-14 01:58:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2023-02-14 01:58:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 88 states have internal predecessors, (92), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 01:58:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2023-02-14 01:58:08,172 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 16 [2023-02-14 01:58:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:08,172 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2023-02-14 01:58:08,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2023-02-14 01:58:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:58:08,173 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:08,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:08,183 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-14 01:58:08,380 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-14 01:58:08,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -789228779, now seen corresponding path program 1 times [2023-02-14 01:58:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:08,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467240803] [2023-02-14 01:58:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:08,382 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-14 01:58:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:08,383 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-14 01:58:08,394 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-14 01:58:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:08,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:58:08,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:08,487 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-14 01:58:08,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:08,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:08,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467240803] [2023-02-14 01:58:08,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467240803] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:08,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:08,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:58:08,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211124558] [2023-02-14 01:58:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:08,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:08,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:08,489 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:08,503 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2023-02-14 01:58:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:58:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-14 01:58:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:08,504 INFO L225 Difference]: With dead ends: 91 [2023-02-14 01:58:08,504 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 01:58:08,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:08,505 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:08,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 308 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:58:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 01:58:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2023-02-14 01:58:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2023-02-14 01:58:08,507 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 16 [2023-02-14 01:58:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:08,508 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2023-02-14 01:58:08,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2023-02-14 01:58:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:58:08,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:08,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:08,529 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-14 01:58:08,715 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-14 01:58:08,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2029051719, now seen corresponding path program 1 times [2023-02-14 01:58:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:08,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397655401] [2023-02-14 01:58:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:08,716 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-14 01:58:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:08,717 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-14 01:58:08,718 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-14 01:58:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:08,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:58:08,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:08,797 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-14 01:58:08,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:08,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:08,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397655401] [2023-02-14 01:58:08,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397655401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:08,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:08,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444577267] [2023-02-14 01:58:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:08,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:58:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:58:08,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:58:08,799 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:08,910 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2023-02-14 01:58:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:58:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-14 01:58:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:08,911 INFO L225 Difference]: With dead ends: 85 [2023-02-14 01:58:08,911 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 01:58:08,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:08,911 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:08,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 197 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:58:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 01:58:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-14 01:58:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2023-02-14 01:58:08,913 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 18 [2023-02-14 01:58:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:08,914 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2023-02-14 01:58:08,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2023-02-14 01:58:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:58:08,914 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:08,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:08,925 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-14 01:58:09,121 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-14 01:58:09,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:09,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2029051718, now seen corresponding path program 1 times [2023-02-14 01:58:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:09,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908348008] [2023-02-14 01:58:09,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:09,122 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-14 01:58:09,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:09,124 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-14 01:58:09,126 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-14 01:58:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:09,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:58:09,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:09,298 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-14 01:58:09,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:09,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:09,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908348008] [2023-02-14 01:58:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908348008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:09,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:09,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:58:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772207004] [2023-02-14 01:58:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:09,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:58:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:58:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:58:09,299 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:09,497 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2023-02-14 01:58:09,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:58:09,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-14 01:58:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:09,498 INFO L225 Difference]: With dead ends: 84 [2023-02-14 01:58:09,498 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 01:58:09,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:58:09,499 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 80 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:09,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 273 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:58:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 01:58:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-14 01:58:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2023-02-14 01:58:09,501 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 18 [2023-02-14 01:58:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:09,501 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2023-02-14 01:58:09,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2023-02-14 01:58:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 01:58:09,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:09,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:09,522 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 (13)] Ended with exit code 0 [2023-02-14 01:58:09,710 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-14 01:58:09,710 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -781083149, now seen corresponding path program 1 times [2023-02-14 01:58:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:09,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186817658] [2023-02-14 01:58:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:09,711 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-14 01:58:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:09,721 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-14 01:58:09,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 (14)] Waiting until timeout for monitored process [2023-02-14 01:58:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:09,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:58:09,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:09,868 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-14 01:58:09,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:09,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:09,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186817658] [2023-02-14 01:58:09,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186817658] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:09,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:09,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349805853] [2023-02-14 01:58:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:09,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:58:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:09,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:58:09,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:09,870 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:10,148 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2023-02-14 01:58:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:58:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-14 01:58:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:10,149 INFO L225 Difference]: With dead ends: 121 [2023-02-14 01:58:10,149 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 01:58:10,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:58:10,149 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 94 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:10,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 124 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:58:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 01:58:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2023-02-14 01:58:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 79 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 01:58:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2023-02-14 01:58:10,152 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 19 [2023-02-14 01:58:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:10,152 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2023-02-14 01:58:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2023-02-14 01:58:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 01:58:10,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:10,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:10,166 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-14 01:58:10,361 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-14 01:58:10,361 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -781083148, now seen corresponding path program 1 times [2023-02-14 01:58:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:10,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212910966] [2023-02-14 01:58:10,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:10,363 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-14 01:58:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:10,364 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-14 01:58:10,366 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-14 01:58:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:10,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:58:10,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:10,526 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-14 01:58:10,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:10,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:10,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212910966] [2023-02-14 01:58:10,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212910966] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:10,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:10,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:58:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762603388] [2023-02-14 01:58:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:10,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:58:10,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:58:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:10,528 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:10,745 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2023-02-14 01:58:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:58:10,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-14 01:58:10,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:10,746 INFO L225 Difference]: With dead ends: 102 [2023-02-14 01:58:10,746 INFO L226 Difference]: Without dead ends: 102 [2023-02-14 01:58:10,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:58:10,747 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 237 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.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:10,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 237 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:58:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-14 01:58:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2023-02-14 01:58:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.375) internal successors, (88), 85 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 01:58:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2023-02-14 01:58:10,749 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 19 [2023-02-14 01:58:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:10,749 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2023-02-14 01:58:10,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:58:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2023-02-14 01:58:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 01:58:10,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:10,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:10,763 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 (15)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:10,950 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-14 01:58:10,950 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -151348929, now seen corresponding path program 1 times [2023-02-14 01:58:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:10,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643853425] [2023-02-14 01:58:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:10,951 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-14 01:58:10,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:10,955 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-14 01:58:10,957 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-14 01:58:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:11,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:58:11,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:11,051 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-14 01:58:11,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:11,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:11,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643853425] [2023-02-14 01:58:11,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643853425] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:11,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:11,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:58:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050384549] [2023-02-14 01:58:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:11,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:58:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:58:11,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:58:11,053 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 01:58:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:11,171 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2023-02-14 01:58:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:58:11,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-14 01:58:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:11,174 INFO L225 Difference]: With dead ends: 101 [2023-02-14 01:58:11,174 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 01:58:11,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:58:11,174 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:11,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 83 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:58:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 01:58:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-14 01:58:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.46) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2023-02-14 01:58:11,177 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 24 [2023-02-14 01:58:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:11,177 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2023-02-14 01:58:11,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 01:58:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2023-02-14 01:58:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:58:11,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:11,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:11,185 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 (16)] Ended with exit code 0 [2023-02-14 01:58:11,378 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-14 01:58:11,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 345895671, now seen corresponding path program 1 times [2023-02-14 01:58:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:11,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741774052] [2023-02-14 01:58:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:11,380 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-14 01:58:11,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:11,382 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-14 01:58:11,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 (17)] Waiting until timeout for monitored process [2023-02-14 01:58:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:11,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 01:58:11,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:11,469 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-14 01:58:11,676 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-14 01:58:11,680 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-14 01:58:11,802 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-14 01:58:11,806 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-14 01:58:11,859 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-14 01:58:11,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:11,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741774052] [2023-02-14 01:58:11,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741774052] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:11,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:11,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-14 01:58:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913616437] [2023-02-14 01:58:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:58:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:58:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:58:11,860 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:12,672 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2023-02-14 01:58:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:58:12,672 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-14 01:58:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:12,673 INFO L225 Difference]: With dead ends: 103 [2023-02-14 01:58:12,673 INFO L226 Difference]: Without dead ends: 103 [2023-02-14 01:58:12,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-02-14 01:58:12,674 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 98 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:12,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 337 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:58:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-14 01:58:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2023-02-14 01:58:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 70 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:58:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2023-02-14 01:58:12,676 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 27 [2023-02-14 01:58:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:12,676 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2023-02-14 01:58:12,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2023-02-14 01:58:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:58:12,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:12,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:12,692 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-14 01:58:12,884 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-14 01:58:12,884 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 345895670, now seen corresponding path program 1 times [2023-02-14 01:58:12,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010044220] [2023-02-14 01:58:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:12,885 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-14 01:58:12,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:12,901 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-14 01:58:12,901 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-14 01:58:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:12,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 01:58:12,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:12,981 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 7 [2023-02-14 01:58:13,110 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-14 01:58:13,200 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-14 01:58:13,237 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-14 01:58:13,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:13,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010044220] [2023-02-14 01:58:13,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010044220] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:13,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:13,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 01:58:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927348296] [2023-02-14 01:58:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:13,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:58:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:58:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:58:13,238 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:14,030 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2023-02-14 01:58:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 01:58:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-14 01:58:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:14,031 INFO L225 Difference]: With dead ends: 101 [2023-02-14 01:58:14,031 INFO L226 Difference]: Without dead ends: 101 [2023-02-14 01:58:14,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-02-14 01:58:14,032 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 100 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:14,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 302 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 01:58:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-14 01:58:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2023-02-14 01:58:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 71 states have internal predecessors, (75), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:58:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-14 01:58:14,034 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 27 [2023-02-14 01:58:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:14,034 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-14 01:58:14,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-14 01:58:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:58:14,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:14,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:14,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 (18)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:14,235 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-14 01:58:14,236 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -566103308, now seen corresponding path program 1 times [2023-02-14 01:58:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:14,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233696976] [2023-02-14 01:58:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:14,236 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-14 01:58:14,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:14,237 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-14 01:58:14,239 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-14 01:58:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:14,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 01:58:14,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:14,331 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 7 [2023-02-14 01:58:14,469 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-14 01:58:14,583 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-14 01:58:14,661 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-14 01:58:14,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:14,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:14,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233696976] [2023-02-14 01:58:14,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233696976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:14,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:14,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 01:58:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615709369] [2023-02-14 01:58:14,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:14,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 01:58:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 01:58:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-02-14 01:58:14,662 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:15,689 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2023-02-14 01:58:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 01:58:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-14 01:58:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:15,691 INFO L225 Difference]: With dead ends: 104 [2023-02-14 01:58:15,691 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 01:58:15,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:58:15,691 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 133 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:15,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 298 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:58:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 01:58:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-02-14 01:58:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 78 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:58:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-02-14 01:58:15,693 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 32 [2023-02-14 01:58:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:15,694 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-02-14 01:58:15,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-02-14 01:58:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:58:15,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:15,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:15,704 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-14 01:58:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 01:58:15,900 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash -566103307, now seen corresponding path program 1 times [2023-02-14 01:58:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963359804] [2023-02-14 01:58:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:15,901 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-14 01:58:15,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:15,902 INFO L229 MonitoredProcess]: Starting monitored process 20 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-14 01:58:15,905 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 (20)] Waiting until timeout for monitored process [2023-02-14 01:58:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:16,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-14 01:58:16,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:16,039 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-14 01:58:16,257 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-14 01:58:16,261 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-14 01:58:16,406 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-14 01:58:16,409 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-14 01:58:16,549 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-14 01:58:16,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:16,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:16,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963359804] [2023-02-14 01:58:16,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963359804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:16,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:16,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-14 01:58:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977256403] [2023-02-14 01:58:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:16,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 01:58:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 01:58:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-14 01:58:16,551 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:17,559 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2023-02-14 01:58:17,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 01:58:17,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2023-02-14 01:58:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:17,560 INFO L225 Difference]: With dead ends: 102 [2023-02-14 01:58:17,560 INFO L226 Difference]: Without dead ends: 102 [2023-02-14 01:58:17,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2023-02-14 01:58:17,575 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 109 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:17,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 353 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-14 01:58:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-14 01:58:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2023-02-14 01:58:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 78 states have internal predecessors, (86), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:58:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-14 01:58:17,592 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 32 [2023-02-14 01:58:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:17,593 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-14 01:58:17,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-14 01:58:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 01:58:17,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:17,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:17,602 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 (20)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:17,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-14 01:58:17,795 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:17,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash -372722091, now seen corresponding path program 1 times [2023-02-14 01:58:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:17,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122147366] [2023-02-14 01:58:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:17,796 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-14 01:58:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:17,797 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-14 01:58:17,801 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-14 01:58:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:17,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 01:58:17,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:17,937 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:17,937 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 13 treesize of output 13 [2023-02-14 01:58:18,087 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-14 01:58:18,172 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-14 01:58:18,217 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-14 01:58:18,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:18,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:18,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122147366] [2023-02-14 01:58:18,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122147366] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:18,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:18,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 01:58:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290755090] [2023-02-14 01:58:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:18,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 01:58:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 01:58:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-02-14 01:58:18,219 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:19,191 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2023-02-14 01:58:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:58:19,191 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2023-02-14 01:58:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:19,192 INFO L225 Difference]: With dead ends: 131 [2023-02-14 01:58:19,192 INFO L226 Difference]: Without dead ends: 131 [2023-02-14 01:58:19,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:58:19,193 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 234 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:19,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 129 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:58:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-14 01:58:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 85. [2023-02-14 01:58:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-14 01:58:19,195 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2023-02-14 01:58:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:19,195 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-14 01:58:19,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-14 01:58:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:58:19,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:19,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:19,205 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-14 01:58:19,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 01:58:19,401 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1552970525, now seen corresponding path program 1 times [2023-02-14 01:58:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:19,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611805321] [2023-02-14 01:58:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:19,402 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-14 01:58:19,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:19,404 INFO L229 MonitoredProcess]: Starting monitored process 22 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-14 01:58:19,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 (22)] Waiting until timeout for monitored process [2023-02-14 01:58:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:19,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-14 01:58:19,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:19,591 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:19,592 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 13 treesize of output 13 [2023-02-14 01:58:19,632 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 7 treesize of output 3 [2023-02-14 01:58:19,856 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-14 01:58:19,919 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:58:19,968 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:58:19,968 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 19 treesize of output 26 [2023-02-14 01:58:19,979 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-14 01:58:20,166 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 43 treesize of output 35 [2023-02-14 01:58:20,218 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 23 treesize of output 15 [2023-02-14 01:58:20,428 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 01:58:20,429 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 14 [2023-02-14 01:58:20,525 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-14 01:58:20,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:20,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611805321] [2023-02-14 01:58:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611805321] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:20,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:20,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-14 01:58:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187326171] [2023-02-14 01:58:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:20,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-14 01:58:20,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:20,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-14 01:58:20,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=412, Unknown=1, NotChecked=0, Total=462 [2023-02-14 01:58:20,528 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:24,083 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-14 01:58:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:24,556 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2023-02-14 01:58:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 01:58:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-02-14 01:58:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:24,557 INFO L225 Difference]: With dead ends: 89 [2023-02-14 01:58:24,557 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 01:58:24,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=1389, Unknown=1, NotChecked=0, Total=1560 [2023-02-14 01:58:24,558 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 70 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:24,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 526 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 809 Invalid, 5 Unknown, 0 Unchecked, 3.1s Time] [2023-02-14 01:58:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 01:58:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2023-02-14 01:58:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.375) internal successors, (77), 72 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2023-02-14 01:58:24,560 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 35 [2023-02-14 01:58:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:24,560 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2023-02-14 01:58:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2023-02-14 01:58:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:58:24,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:24,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:24,571 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 (22)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:24,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-14 01:58:24,769 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1552970526, now seen corresponding path program 1 times [2023-02-14 01:58:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:24,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955656265] [2023-02-14 01:58:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:24,770 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-14 01:58:24,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:24,771 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-14 01:58:24,773 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-14 01:58:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:24,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-14 01:58:24,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:24,994 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:24,994 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 13 treesize of output 13 [2023-02-14 01:58:25,052 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 7 treesize of output 3 [2023-02-14 01:58:25,059 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 7 treesize of output 3 [2023-02-14 01:58:25,332 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-14 01:58:25,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-14 01:58:25,443 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:58:25,452 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 21 treesize of output 20 [2023-02-14 01:58:25,505 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:58:25,505 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 19 treesize of output 26 [2023-02-14 01:58:25,543 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:58:25,544 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 19 treesize of output 26 [2023-02-14 01:58:25,928 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 46 [2023-02-14 01:58:25,932 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 54 treesize of output 42 [2023-02-14 01:58:26,315 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 01:58:26,315 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 69 treesize of output 36 [2023-02-14 01:58:26,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-14 01:58:26,407 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-14 01:58:26,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:26,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:26,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955656265] [2023-02-14 01:58:26,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955656265] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:26,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:26,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-02-14 01:58:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290314935] [2023-02-14 01:58:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:26,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 01:58:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:26,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 01:58:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2023-02-14 01:58:26,408 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:28,903 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2023-02-14 01:58:28,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 01:58:28,905 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2023-02-14 01:58:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:28,906 INFO L225 Difference]: With dead ends: 87 [2023-02-14 01:58:28,906 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 01:58:28,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2023-02-14 01:58:28,907 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 131 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:28,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 535 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-14 01:58:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 01:58:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-02-14 01:58:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2023-02-14 01:58:28,909 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 35 [2023-02-14 01:58:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:28,909 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2023-02-14 01:58:28,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2023-02-14 01:58:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 01:58:28,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:28,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:28,921 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-14 01:58:29,118 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-14 01:58:29,119 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash 897446074, now seen corresponding path program 1 times [2023-02-14 01:58:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:29,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027090370] [2023-02-14 01:58:29,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:29,120 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-14 01:58:29,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:29,121 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-14 01:58:29,126 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-14 01:58:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:29,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 01:58:29,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:29,283 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:29,284 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 13 treesize of output 13 [2023-02-14 01:58:29,437 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-14 01:58:29,513 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-14 01:58:29,513 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 20 [2023-02-14 01:58:29,518 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-14 01:58:29,732 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 25 treesize of output 17 [2023-02-14 01:58:29,947 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 01:58:29,948 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 35 treesize of output 14 [2023-02-14 01:58:30,011 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-14 01:58:30,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:30,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027090370] [2023-02-14 01:58:30,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027090370] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:30,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:30,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-14 01:58:30,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900525528] [2023-02-14 01:58:30,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:30,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-14 01:58:30,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:30,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-14 01:58:30,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=394, Unknown=4, NotChecked=0, Total=462 [2023-02-14 01:58:30,013 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:33,582 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-14 01:58:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:34,340 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2023-02-14 01:58:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 01:58:34,341 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-02-14 01:58:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:34,341 INFO L225 Difference]: With dead ends: 87 [2023-02-14 01:58:34,341 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 01:58:34,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=271, Invalid=1525, Unknown=10, NotChecked=0, Total=1806 [2023-02-14 01:58:34,342 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 154 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 25 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:34,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 220 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 947 Invalid, 8 Unknown, 0 Unchecked, 3.3s Time] [2023-02-14 01:58:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 01:58:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-02-14 01:58:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 72 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2023-02-14 01:58:34,344 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 36 [2023-02-14 01:58:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:34,344 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2023-02-14 01:58:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2023-02-14 01:58:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 01:58:34,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:34,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:34,352 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 (24)] Ended with exit code 0 [2023-02-14 01:58:34,552 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-14 01:58:34,553 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:34,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash 897446075, now seen corresponding path program 1 times [2023-02-14 01:58:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:34,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142744919] [2023-02-14 01:58:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:34,557 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-14 01:58:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:34,558 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-14 01:58:34,560 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-14 01:58:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:34,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-14 01:58:34,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:34,767 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:34,767 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 13 treesize of output 13 [2023-02-14 01:58:34,774 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-14 01:58:34,979 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-14 01:58:35,008 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-14 01:58:36,150 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-14 01:58:36,150 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 44 treesize of output 44 [2023-02-14 01:58:36,182 INFO L321 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2023-02-14 01:58:36,183 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 24 [2023-02-14 01:58:36,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 38 [2023-02-14 01:58:36,903 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 01:58:36,903 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 14 [2023-02-14 01:58:36,972 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-14 01:58:36,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:36,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:36,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142744919] [2023-02-14 01:58:36,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142744919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:36,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:36,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-02-14 01:58:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796090766] [2023-02-14 01:58:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:36,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 01:58:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 01:58:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:58:36,974 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:43,242 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2023-02-14 01:58:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 01:58:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2023-02-14 01:58:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:43,243 INFO L225 Difference]: With dead ends: 86 [2023-02-14 01:58:43,243 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 01:58:43,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2023-02-14 01:58:43,243 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 148 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:43,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 224 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 879 Invalid, 1 Unknown, 0 Unchecked, 1.5s Time] [2023-02-14 01:58:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 01:58:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-02-14 01:58:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 72 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2023-02-14 01:58:43,245 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 36 [2023-02-14 01:58:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:43,245 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2023-02-14 01:58:43,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 01:58:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2023-02-14 01:58:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:58:43,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:43,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:43,263 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-14 01:58:43,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 01:58:43,454 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2088327703, now seen corresponding path program 1 times [2023-02-14 01:58:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799920485] [2023-02-14 01:58:43,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:43,455 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-14 01:58:43,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:43,456 INFO L229 MonitoredProcess]: Starting monitored process 26 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-14 01:58:43,459 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 (26)] Waiting until timeout for monitored process [2023-02-14 01:58:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:43,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-14 01:58:43,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:43,803 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-14 01:58:43,947 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 23 treesize of output 11 [2023-02-14 01:58:44,136 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-14 01:58:44,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:44,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799920485] [2023-02-14 01:58:44,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799920485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:44,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:44,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 01:58:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009044133] [2023-02-14 01:58:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:44,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:58:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:58:44,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:58:44,138 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:44,833 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2023-02-14 01:58:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:58:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2023-02-14 01:58:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:44,834 INFO L225 Difference]: With dead ends: 86 [2023-02-14 01:58:44,834 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 01:58:44,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:58:44,835 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 78 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:44,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 405 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:58:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 01:58:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-02-14 01:58:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 72 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2023-02-14 01:58:44,837 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 41 [2023-02-14 01:58:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:44,837 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2023-02-14 01:58:44,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2023-02-14 01:58:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 01:58:44,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:44,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:44,845 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 (26)] Ended with exit code 0 [2023-02-14 01:58:45,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-14 01:58:45,046 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 769395034, now seen corresponding path program 1 times [2023-02-14 01:58:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:45,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072340392] [2023-02-14 01:58:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:45,047 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-14 01:58:45,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:45,048 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-14 01:58:45,050 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-14 01:58:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:45,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 01:58:45,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:45,285 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:58:45,285 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 19 treesize of output 27 [2023-02-14 01:58:45,334 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 7 treesize of output 3 [2023-02-14 01:58:45,520 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-14 01:58:45,560 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:58:45,601 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:58:45,602 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 19 treesize of output 26 [2023-02-14 01:58:45,607 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-14 01:58:45,779 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 43 treesize of output 35 [2023-02-14 01:58:45,842 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 23 treesize of output 15 [2023-02-14 01:58:46,247 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2023-02-14 01:58:46,248 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 38 treesize of output 20 [2023-02-14 01:58:46,295 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 14 treesize of output 20 [2023-02-14 01:58:46,331 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-14 01:58:46,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:46,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:46,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072340392] [2023-02-14 01:58:46,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072340392] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:46,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:46,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-02-14 01:58:46,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765457365] [2023-02-14 01:58:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:46,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 01:58:46,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:46,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 01:58:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=557, Unknown=1, NotChecked=0, Total=650 [2023-02-14 01:58:46,333 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 26 states, 24 states have (on average 1.5) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:48,167 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2023-02-14 01:58:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 01:58:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-02-14 01:58:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:48,168 INFO L225 Difference]: With dead ends: 88 [2023-02-14 01:58:48,168 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 01:58:48,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=235, Invalid=1652, Unknown=5, NotChecked=0, Total=1892 [2023-02-14 01:58:48,169 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 15 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:48,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 329 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 790 Invalid, 8 Unknown, 0 Unchecked, 1.0s Time] [2023-02-14 01:58:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 01:58:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2023-02-14 01:58:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 74 states have internal predecessors, (76), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2023-02-14 01:58:48,170 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 44 [2023-02-14 01:58:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:48,170 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2023-02-14 01:58:48,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5) internal successors, (36), 21 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2023-02-14 01:58:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 01:58:48,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:48,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:48,182 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 (27)] Ended with exit code 0 [2023-02-14 01:58:48,378 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 [2023-02-14 01:58:48,379 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 769395035, now seen corresponding path program 1 times [2023-02-14 01:58:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:48,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968498605] [2023-02-14 01:58:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:48,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-14 01:58:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:48,381 INFO L229 MonitoredProcess]: Starting monitored process 28 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-14 01:58:48,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 (28)] Waiting until timeout for monitored process [2023-02-14 01:58:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:48,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-14 01:58:48,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:48,692 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:48,692 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 13 treesize of output 13 [2023-02-14 01:58:48,715 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-14 01:58:48,778 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 7 treesize of output 3 [2023-02-14 01:58:48,784 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 7 treesize of output 3 [2023-02-14 01:58:49,031 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-14 01:58:49,037 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-14 01:58:49,116 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:58:49,136 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 21 treesize of output 20 [2023-02-14 01:58:49,185 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:58:49,185 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 19 treesize of output 26 [2023-02-14 01:58:49,224 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:58:49,224 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 19 treesize of output 26 [2023-02-14 01:58:49,524 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 43 treesize of output 35 [2023-02-14 01:58:49,543 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 43 treesize of output 35 [2023-02-14 01:58:49,956 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 01:58:49,957 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 71 treesize of output 38 [2023-02-14 01:58:49,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 12 [2023-02-14 01:58:50,036 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-14 01:58:50,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:50,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:50,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968498605] [2023-02-14 01:58:50,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968498605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:50,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:50,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-14 01:58:50,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616172547] [2023-02-14 01:58:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-14 01:58:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-14 01:58:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2023-02-14 01:58:50,037 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 22 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:51,996 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2023-02-14 01:58:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 01:58:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-02-14 01:58:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:51,997 INFO L225 Difference]: With dead ends: 88 [2023-02-14 01:58:51,997 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 01:58:51,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2023-02-14 01:58:51,998 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 101 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:51,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 425 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-14 01:58:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 01:58:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2023-02-14 01:58:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.293103448275862) internal successors, (75), 74 states have internal predecessors, (75), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2023-02-14 01:58:52,000 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 44 [2023-02-14 01:58:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:52,001 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2023-02-14 01:58:52,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.8) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:58:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2023-02-14 01:58:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 01:58:52,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:52,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:52,027 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 (28)] Forceful destruction successful, exit code 0 [2023-02-14 01:58:52,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-14 01:58:52,211 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 305014949, now seen corresponding path program 1 times [2023-02-14 01:58:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:52,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140565966] [2023-02-14 01:58:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:52,212 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-14 01:58:52,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:52,213 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-14 01:58:52,215 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-14 01:58:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:52,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:58:52,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:52,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:58:52,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:52,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140565966] [2023-02-14 01:58:52,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140565966] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:58:52,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:58:52,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:58:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378231132] [2023-02-14 01:58:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:58:52,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:58:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:58:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:58:52,366 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 01:58:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:52,539 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2023-02-14 01:58:52,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:58:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2023-02-14 01:58:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:52,540 INFO L225 Difference]: With dead ends: 85 [2023-02-14 01:58:52,540 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 01:58:52,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:58:52,540 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:52,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 172 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:58:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 01:58:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-14 01:58:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 72 states have internal predecessors, (73), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:58:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2023-02-14 01:58:52,542 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 49 [2023-02-14 01:58:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:52,542 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2023-02-14 01:58:52,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 01:58:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2023-02-14 01:58:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 01:58:52,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:52,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:52,555 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-14 01:58:52,743 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-14 01:58:52,743 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:58:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 305014950, now seen corresponding path program 1 times [2023-02-14 01:58:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164789393] [2023-02-14 01:58:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:52,744 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-14 01:58:52,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:52,746 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-14 01:58:52,747 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-14 01:58:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:52,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 01:58:52,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:53,111 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 29 treesize of output 17 [2023-02-14 01:58:53,113 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 20 [2023-02-14 01:58:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:53,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:58:54,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:58:54,425 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 44 treesize of output 46 [2023-02-14 01:58:57,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:58:57,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 111 treesize of output 151 [2023-02-14 01:59:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:00,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:00,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164789393] [2023-02-14 01:59:00,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164789393] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:59:00,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:59:00,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-14 01:59:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065606319] [2023-02-14 01:59:00,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:59:00,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 01:59:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:00,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 01:59:00,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2023-02-14 01:59:00,767 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 01:59:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:06,384 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2023-02-14 01:59:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:59:06,386 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2023-02-14 01:59:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:06,387 INFO L225 Difference]: With dead ends: 96 [2023-02-14 01:59:06,387 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 01:59:06,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2023-02-14 01:59:06,387 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 122 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:06,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 483 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-02-14 01:59:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 01:59:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2023-02-14 01:59:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.253968253968254) internal successors, (79), 77 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:59:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2023-02-14 01:59:06,389 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 49 [2023-02-14 01:59:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:06,390 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2023-02-14 01:59:06,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 22 states have internal predecessors, (60), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 01:59:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2023-02-14 01:59:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-14 01:59:06,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:06,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:06,402 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-14 01:59:06,600 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 [2023-02-14 01:59:06,600 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:59:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 862140099, now seen corresponding path program 1 times [2023-02-14 01:59:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:06,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671567736] [2023-02-14 01:59:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:06,602 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-14 01:59:06,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:06,603 INFO L229 MonitoredProcess]: Starting monitored process 31 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-14 01:59:06,604 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 (31)] Waiting until timeout for monitored process [2023-02-14 01:59:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:06,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:59:06,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:06,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:06,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:06,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671567736] [2023-02-14 01:59:06,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671567736] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:06,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:06,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:59:06,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492026217] [2023-02-14 01:59:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:06,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:59:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:06,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:59:06,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:59:06,800 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 01:59:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:07,068 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2023-02-14 01:59:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:59:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2023-02-14 01:59:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:07,069 INFO L225 Difference]: With dead ends: 89 [2023-02-14 01:59:07,069 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 01:59:07,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:59:07,070 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:07,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 153 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 01:59:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-14 01:59:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 75 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:59:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2023-02-14 01:59:07,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 50 [2023-02-14 01:59:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:07,073 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2023-02-14 01:59:07,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 01:59:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2023-02-14 01:59:07,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-14 01:59:07,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:07,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:07,099 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 (31)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:07,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-14 01:59:07,282 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:59:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 862140100, now seen corresponding path program 1 times [2023-02-14 01:59:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:07,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17923905] [2023-02-14 01:59:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:07,283 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-14 01:59:07,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:07,285 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-14 01:59:07,285 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-14 01:59:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:07,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:59:07,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:59:07,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:07,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:07,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17923905] [2023-02-14 01:59:07,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17923905] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:07,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:07,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:59:07,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136350988] [2023-02-14 01:59:07,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:07,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:59:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:59:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:59:07,623 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 01:59:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:07,907 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-02-14 01:59:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:59:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2023-02-14 01:59:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:07,909 INFO L225 Difference]: With dead ends: 88 [2023-02-14 01:59:07,909 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 01:59:07,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:59:07,909 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:07,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:59:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 01:59:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-14 01:59:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 74 states have internal predecessors, (76), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:59:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2023-02-14 01:59:07,911 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 50 [2023-02-14 01:59:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:07,911 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2023-02-14 01:59:07,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 01:59:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2023-02-14 01:59:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 01:59:07,912 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:07,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:59:07,920 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-14 01:59:08,112 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-14 01:59:08,112 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:59:08,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash 956539334, now seen corresponding path program 1 times [2023-02-14 01:59:08,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:08,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69746257] [2023-02-14 01:59:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:08,113 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-14 01:59:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:08,114 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-14 01:59:08,116 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-14 01:59:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:08,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 01:59:08,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:08,330 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 7 treesize of output 3 [2023-02-14 01:59:08,340 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 7 treesize of output 3 [2023-02-14 01:59:08,525 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 23 treesize of output 15 [2023-02-14 01:59:08,527 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-14 01:59:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:59:08,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:59:08,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:08,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69746257] [2023-02-14 01:59:08,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69746257] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:59:08,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:59:08,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 01:59:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736107854] [2023-02-14 01:59:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:59:08,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:59:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:59:08,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:59:08,675 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 01:59:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:09,438 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-14 01:59:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 01:59:09,439 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2023-02-14 01:59:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:09,441 INFO L225 Difference]: With dead ends: 87 [2023-02-14 01:59:09,442 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 01:59:09,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:59:09,443 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:09,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 260 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:59:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 01:59:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-14 01:59:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 73 states have internal predecessors, (75), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-14 01:59:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2023-02-14 01:59:09,458 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 51 [2023-02-14 01:59:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:09,458 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2023-02-14 01:59:09,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 01:59:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2023-02-14 01:59:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 01:59:09,459 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:09,459 INFO L195 NwaCegarLoop]: trace histogram [2, 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-14 01:59:09,469 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 (33)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:09,668 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-14 01:59:09,668 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-02-14 01:59:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1450404916, now seen corresponding path program 1 times [2023-02-14 01:59:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:09,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377068866] [2023-02-14 01:59:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:09,669 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-14 01:59:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:09,670 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-14 01:59:09,672 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-14 01:59:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:09,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 01:59:09,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:09,992 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:59:09,993 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 18 [2023-02-14 01:59:10,008 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:59:10,009 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 13 treesize of output 13 [2023-02-14 01:59:10,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 7 treesize of output 3 [2023-02-14 01:59:10,318 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-14 01:59:10,397 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 01:59:10,452 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:59:10,452 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 19 treesize of output 26 [2023-02-14 01:59:10,457 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-14 01:59:10,664 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 43 treesize of output 35 [2023-02-14 01:59:10,756 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 23 treesize of output 15 [2023-02-14 01:59:10,888 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-14 01:59:10,888 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 35 treesize of output 14 [2023-02-14 01:59:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:11,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:59:12,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:12,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377068866] [2023-02-14 01:59:12,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377068866] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:59:12,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648022598] [2023-02-14 01:59:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:12,813 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:59:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:59:12,815 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:59:12,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-02-14 01:59:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:13,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-14 01:59:13,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:13,472 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:59:13,472 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 13 treesize of output 13 [2023-02-14 01:59:13,655 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 7 treesize of output 3 [2023-02-14 01:59:13,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 7 treesize of output 3 [2023-02-14 01:59:14,215 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-14 01:59:14,221 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-14 01:59:14,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:59:14,350 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 21 treesize of output 20 [2023-02-14 01:59:14,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:59:14,368 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 21 treesize of output 20 [2023-02-14 01:59:14,403 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:59:14,403 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 19 treesize of output 26 [2023-02-14 01:59:14,442 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 01:59:14,442 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 19 treesize of output 26 [2023-02-14 01:59:14,801 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 43 treesize of output 35 [2023-02-14 01:59:14,811 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 43 treesize of output 35 [2023-02-14 01:59:15,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:15,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-02-14 01:59:15,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2023-02-14 01:59:15,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:15,965 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 3 case distinctions, treesize of input 67 treesize of output 39 [2023-02-14 01:59:15,974 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 01:59:15,975 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 39 treesize of output 23 [2023-02-14 01:59:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:59:16,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:59:20,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:59:20,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:59:22,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:22,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 61693 treesize of output 52062 [2023-02-14 01:59:23,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:59:23,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122536 treesize of output 120704