./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:38:42,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:38:42,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:38:42,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:38:42,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:38:42,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:38:42,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:38:42,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:38:42,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:38:42,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:38:42,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:38:42,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:38:42,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:38:42,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:38:42,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:38:42,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:38:42,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:38:42,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:38:42,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:38:42,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:38:42,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:38:42,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:38:42,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:38:42,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:38:42,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:38:42,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:38:42,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:38:42,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:38:42,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:38:42,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:38:42,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:38:42,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:38:42,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:38:42,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:38:42,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:38:42,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:38:42,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:38:42,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:38:42,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:38:42,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:38:42,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:38:42,583 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:38:42,619 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:38:42,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:38:42,620 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:38:42,620 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:38:42,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:38:42,621 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:38:42,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:38:42,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:38:42,622 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:38:42,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:38:42,623 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:38:42,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:38:42,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:38:42,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:38:42,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:38:42,624 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:38:42,624 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:38:42,624 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:38:42,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:38:42,625 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:38:42,625 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:38:42,625 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:38:42,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:38:42,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:38:42,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:38:42,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:38:42,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:38:42,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:38:42,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:38:42,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:38:42,627 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:38:42,627 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:38:42,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:38:42,628 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:38:42,628 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2023-02-14 01:38:42,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:38:42,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:38:42,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:38:42,909 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:38:42,910 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:38:42,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-14 01:38:44,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:38:44,354 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:38:44,354 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-14 01:38:44,363 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae54eede8/6ef25c203f8746c8bb70a7905e81740d/FLAG562627746 [2023-02-14 01:38:44,378 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae54eede8/6ef25c203f8746c8bb70a7905e81740d [2023-02-14 01:38:44,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:38:44,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:38:44,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:38:44,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:38:44,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:38:44,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:38:44" (1/1) ... [2023-02-14 01:38:44,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1597cb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:44, skipping insertion in model container [2023-02-14 01:38:44,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:38:44" (1/1) ... [2023-02-14 01:38:44,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:38:44,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:38:44,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:38:44,692 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:38:44,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@487880c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:44, skipping insertion in model container [2023-02-14 01:38:44,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:38:44,695 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-14 01:38:44,697 INFO L158 Benchmark]: Toolchain (without parser) took 313.36ms. Allocated memory is still 130.0MB. Free memory was 85.3MB in the beginning and 73.7MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 01:38:44,698 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 130.0MB. Free memory was 106.3MB in the beginning and 106.3MB in the end (delta: 23.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 01:38:44,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.69ms. Allocated memory is still 130.0MB. Free memory was 85.0MB in the beginning and 73.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 01:38:44,700 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.39ms. Allocated memory is still 130.0MB. Free memory was 106.3MB in the beginning and 106.3MB in the end (delta: 23.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.69ms. Allocated memory is still 130.0MB. Free memory was 85.0MB in the beginning and 73.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:38:46,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:38:46,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:38:46,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:38:46,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:38:46,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:38:46,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:38:46,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:38:46,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:38:46,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:38:46,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:38:46,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:38:46,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:38:46,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:38:46,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:38:46,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:38:46,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:38:46,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:38:46,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:38:46,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:38:46,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:38:46,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:38:46,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:38:46,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:38:46,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:38:46,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:38:46,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:38:46,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:38:46,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:38:46,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:38:46,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:38:46,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:38:46,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:38:46,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:38:46,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:38:46,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:38:46,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:38:46,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:38:46,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:38:46,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:38:46,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:38:46,744 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:38:46,785 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:38:46,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:38:46,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:38:46,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:38:46,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:38:46,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:38:46,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:38:46,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:38:46,788 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:38:46,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:38:46,789 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:38:46,790 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:38:46,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:38:46,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:38:46,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:38:46,790 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:38:46,790 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:38:46,791 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:38:46,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:38:46,791 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:38:46,791 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 01:38:46,791 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 01:38:46,791 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:38:46,792 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:38:46,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:38:46,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:38:46,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:38:46,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:38:46,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:38:46,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:38:46,793 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 01:38:46,793 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 01:38:46,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:38:46,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:38:46,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:38:46,794 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 01:38:46,794 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:38:46,794 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2023-02-14 01:38:47,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:38:47,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:38:47,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:38:47,144 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:38:47,145 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:38:47,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-14 01:38:48,380 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:38:48,685 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:38:48,690 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-14 01:38:48,701 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f4ba2e6/7d74dbdeaebc47aabafe2d1c78fe05d5/FLAG2a733f96d [2023-02-14 01:38:48,715 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f4ba2e6/7d74dbdeaebc47aabafe2d1c78fe05d5 [2023-02-14 01:38:48,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:38:48,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:38:48,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:38:48,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:38:48,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:38:48,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:38:48" (1/1) ... [2023-02-14 01:38:48,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62fa3ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:48, skipping insertion in model container [2023-02-14 01:38:48,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:38:48" (1/1) ... [2023-02-14 01:38:48,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:38:48,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:38:49,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:38:49,064 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-14 01:38:49,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:38:49,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:38:49,127 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:38:49,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:38:49,184 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:38:49,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49 WrapperNode [2023-02-14 01:38:49,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:38:49,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:38:49,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:38:49,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:38:49,192 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:38:49" (1/1) ... [2023-02-14 01:38:49,206 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:38:49" (1/1) ... [2023-02-14 01:38:49,224 INFO L138 Inliner]: procedures = 117, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-02-14 01:38:49,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:38:49,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:38:49,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:38:49,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:38:49,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,253 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:38:49,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:38:49,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:38:49,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:38:49,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (1/1) ... [2023-02-14 01:38:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:38:49,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:38:49,290 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:38:49,310 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:38:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-14 01:38:49,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 01:38:49,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:38:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-14 01:38:49,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:38:49,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:38:49,488 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:38:49,490 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:38:49,976 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:38:49,985 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:38:49,986 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-14 01:38:49,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:38:49 BoogieIcfgContainer [2023-02-14 01:38:49,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:38:49,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:38:49,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:38:49,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:38:49,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:38:48" (1/3) ... [2023-02-14 01:38:49,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ea088a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:38:49, skipping insertion in model container [2023-02-14 01:38:49,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:38:49" (2/3) ... [2023-02-14 01:38:49,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ea088a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:38:49, skipping insertion in model container [2023-02-14 01:38:49,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:38:49" (3/3) ... [2023-02-14 01:38:49,996 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2023-02-14 01:38:50,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:38:50,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-02-14 01:38:50,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:38:50,063 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;@1df25d64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:38:50,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-02-14 01:38:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 01:38:50,072 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:50,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 01:38:50,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2023-02-14 01:38:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:50,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693399158] [2023-02-14 01:38:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:50,088 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:38:50,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:50,090 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:38:50,091 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:38:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:50,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:38:50,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:50,244 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:38:50,260 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:38:50,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:50,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:50,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693399158] [2023-02-14 01:38:50,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693399158] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:50,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:50,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:38:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31248744] [2023-02-14 01:38:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:50,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:38:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:38:50,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:38:50,315 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:50,435 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2023-02-14 01:38:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:38:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 01:38:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:50,443 INFO L225 Difference]: With dead ends: 66 [2023-02-14 01:38:50,444 INFO L226 Difference]: Without dead ends: 64 [2023-02-14 01:38:50,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:38:50,448 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:50,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:38:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-14 01:38:50,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-14 01:38:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-02-14 01:38:50,482 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 6 [2023-02-14 01:38:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:50,483 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-02-14 01:38:50,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-02-14 01:38:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 01:38:50,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:50,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 01:38:50,497 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 (2)] Forceful destruction successful, exit code 0 [2023-02-14 01:38:50,697 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:38:50,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2023-02-14 01:38:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:50,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537773722] [2023-02-14 01:38:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:50,699 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:38:50,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:50,700 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:38:50,701 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:38:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:50,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:38:50,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:50,831 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:38:50,877 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:38:50,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:50,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:50,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537773722] [2023-02-14 01:38:50,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537773722] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:50,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:50,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:38:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586787346] [2023-02-14 01:38:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:50,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:38:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:38:50,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:38:50,882 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:51,196 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2023-02-14 01:38:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:38:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 01:38:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:51,198 INFO L225 Difference]: With dead ends: 129 [2023-02-14 01:38:51,199 INFO L226 Difference]: Without dead ends: 129 [2023-02-14 01:38:51,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:51,200 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:51,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 275 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:38:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-14 01:38:51,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 67. [2023-02-14 01:38:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2023-02-14 01:38:51,206 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 6 [2023-02-14 01:38:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:51,207 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2023-02-14 01:38:51,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2023-02-14 01:38:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 01:38:51,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:51,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 01:38:51,217 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:38:51,414 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:38:51,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2023-02-14 01:38:51,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:51,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399562261] [2023-02-14 01:38:51,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:51,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:38:51,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:51,418 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:38:51,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 01:38:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:51,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:38:51,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:51,506 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 8 treesize of output 7 [2023-02-14 01:38:51,579 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:38:51,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:51,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399562261] [2023-02-14 01:38:51,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399562261] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:51,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:51,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:38:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855122441] [2023-02-14 01:38:51,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:51,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:38:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:38:51,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:38:51,584 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:51,836 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-02-14 01:38:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:38:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 01:38:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:51,838 INFO L225 Difference]: With dead ends: 71 [2023-02-14 01:38:51,838 INFO L226 Difference]: Without dead ends: 71 [2023-02-14 01:38:51,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:51,840 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 74 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:51,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 109 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-14 01:38:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2023-02-14 01:38:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2023-02-14 01:38:51,845 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 6 [2023-02-14 01:38:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:51,846 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2023-02-14 01:38:51,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2023-02-14 01:38:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 01:38:51,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:51,846 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:51,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-14 01:38:52,059 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:38:52,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2023-02-14 01:38:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431647585] [2023-02-14 01:38:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:52,061 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:38:52,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:52,062 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:38:52,069 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:38:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:52,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:38:52,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:52,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:38:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:52,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:52,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431647585] [2023-02-14 01:38:52,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431647585] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:38:52,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:38:52,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-14 01:38:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698004884] [2023-02-14 01:38:52,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:38:52,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:38:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:38:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:38:52,249 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:52,328 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-02-14 01:38:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:38:52,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 01:38:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:52,335 INFO L225 Difference]: With dead ends: 127 [2023-02-14 01:38:52,335 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 01:38:52,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:38:52,336 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 247 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:52,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 258 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:38:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 01:38:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2023-02-14 01:38:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-02-14 01:38:52,343 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 10 [2023-02-14 01:38:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:52,343 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-02-14 01:38:52,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-02-14 01:38:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 01:38:52,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:52,344 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:52,354 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 (5)] Forceful destruction successful, exit code 0 [2023-02-14 01:38:52,549 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:38:52,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2023-02-14 01:38:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:52,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765141128] [2023-02-14 01:38:52,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:52,553 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:38:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:52,554 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:38:52,562 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:38:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:52,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:38:52,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:52,636 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 8 treesize of output 7 [2023-02-14 01:38:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:52,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:38:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:53,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:53,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765141128] [2023-02-14 01:38:53,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765141128] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:38:53,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:38:53,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-14 01:38:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29670755] [2023-02-14 01:38:53,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:38:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:38:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:38:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:38:53,159 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:54,216 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2023-02-14 01:38:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:38:54,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 01:38:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:54,218 INFO L225 Difference]: With dead ends: 140 [2023-02-14 01:38:54,218 INFO L226 Difference]: Without dead ends: 140 [2023-02-14 01:38:54,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-02-14 01:38:54,220 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 339 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:54,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 208 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:38:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-14 01:38:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 84. [2023-02-14 01:38:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 83 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-14 01:38:54,226 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 10 [2023-02-14 01:38:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:54,227 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-14 01:38:54,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-14 01:38:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:38:54,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:54,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:54,241 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:38:54,437 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:38:54,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:54,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:54,438 INFO L85 PathProgramCache]: Analyzing trace with hash -680998152, now seen corresponding path program 1 times [2023-02-14 01:38:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:54,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880866333] [2023-02-14 01:38:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:54,439 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:38:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:54,440 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:38:54,443 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:38:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:54,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:38:54,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:54,519 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:38:54,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 01:38:54,530 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:38:54,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:54,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880866333] [2023-02-14 01:38:54,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880866333] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:54,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:54,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:38:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078430691] [2023-02-14 01:38:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:54,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:38:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:38:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:38:54,534 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:54,635 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-02-14 01:38:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:38:54,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 01:38:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:54,637 INFO L225 Difference]: With dead ends: 77 [2023-02-14 01:38:54,637 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 01:38:54,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:38:54,638 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:54,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:38:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 01:38:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-14 01:38:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-14 01:38:54,648 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 12 [2023-02-14 01:38:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:54,648 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-14 01:38:54,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-14 01:38:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:38:54,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:54,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:54,657 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:38:54,853 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:38:54,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:54,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -680998151, now seen corresponding path program 1 times [2023-02-14 01:38:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:54,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641106713] [2023-02-14 01:38:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:54,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:38:54,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:54,855 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:38:54,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 (8)] Waiting until timeout for monitored process [2023-02-14 01:38:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:54,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 01:38:54,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:54,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:38:54,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-14 01:38:54,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:38:54,989 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:38:54,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:54,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641106713] [2023-02-14 01:38:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641106713] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:54,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:54,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:38:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34632012] [2023-02-14 01:38:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:54,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:38:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:54,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:38:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:38:54,995 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:55,207 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2023-02-14 01:38:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:38:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 01:38:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:55,213 INFO L225 Difference]: With dead ends: 132 [2023-02-14 01:38:55,213 INFO L226 Difference]: Without dead ends: 132 [2023-02-14 01:38:55,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:55,214 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:55,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 139 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-14 01:38:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2023-02-14 01:38:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2023-02-14 01:38:55,218 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 12 [2023-02-14 01:38:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:55,218 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-02-14 01:38:55,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2023-02-14 01:38:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:38:55,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:55,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:55,235 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:38:55,429 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:38:55,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025161, now seen corresponding path program 1 times [2023-02-14 01:38:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:55,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422625219] [2023-02-14 01:38:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:55,430 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:38:55,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:55,432 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:38:55,435 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:38:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:55,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:38:55,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:55,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:38:55,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-14 01:38:55,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:38:55,587 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:38:55,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:55,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:55,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422625219] [2023-02-14 01:38:55,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422625219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:55,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:55,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:38:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715177170] [2023-02-14 01:38:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:55,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:38:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:55,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:38:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:55,590 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:55,872 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2023-02-14 01:38:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:38:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 01:38:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:55,874 INFO L225 Difference]: With dead ends: 87 [2023-02-14 01:38:55,874 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 01:38:55,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:38:55,875 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:55,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 104 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 01:38:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2023-02-14 01:38:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.467741935483871) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2023-02-14 01:38:55,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 12 [2023-02-14 01:38:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:55,885 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2023-02-14 01:38:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2023-02-14 01:38:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:38:55,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:55,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:55,902 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:38:56,086 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:38:56,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 363893777, now seen corresponding path program 1 times [2023-02-14 01:38:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891697623] [2023-02-14 01:38:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:56,088 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:38:56,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:56,089 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:38:56,090 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:38:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:56,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:38:56,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:56,180 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:38:56,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-14 01:38:56,191 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:38:56,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:56,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:56,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891697623] [2023-02-14 01:38:56,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891697623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:56,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:56,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:38:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040872451] [2023-02-14 01:38:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:56,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:38:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:38:56,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:38:56,194 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:56,270 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2023-02-14 01:38:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:38:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-14 01:38:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:56,271 INFO L225 Difference]: With dead ends: 77 [2023-02-14 01:38:56,271 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 01:38:56,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:38:56,272 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:56,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:38:56,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 01:38:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-14 01:38:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2023-02-14 01:38:56,275 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 13 [2023-02-14 01:38:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:56,275 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2023-02-14 01:38:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2023-02-14 01:38:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:38:56,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:56,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:56,288 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:38:56,486 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:38:56,486 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 363893778, now seen corresponding path program 1 times [2023-02-14 01:38:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:56,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717201664] [2023-02-14 01:38:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:56,487 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:38:56,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:56,489 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:38:56,492 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:38:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:56,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:38:56,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:56,604 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:38:56,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-14 01:38:56,629 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:38:56,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:56,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717201664] [2023-02-14 01:38:56,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717201664] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:56,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:56,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:38:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862836907] [2023-02-14 01:38:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:56,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:38:56,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:38:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:38:56,632 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:56,810 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2023-02-14 01:38:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:38:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-14 01:38:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:56,811 INFO L225 Difference]: With dead ends: 128 [2023-02-14 01:38:56,811 INFO L226 Difference]: Without dead ends: 128 [2023-02-14 01:38:56,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:56,812 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:56,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 133 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-14 01:38:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 81. [2023-02-14 01:38:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 80 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-14 01:38:56,816 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 13 [2023-02-14 01:38:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:56,816 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-14 01:38:56,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-14 01:38:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:38:56,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:56,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:56,825 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:38:57,021 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:38:57,021 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1064958356, now seen corresponding path program 1 times [2023-02-14 01:38:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548863574] [2023-02-14 01:38:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:38:57,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:57,023 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:38:57,024 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:38:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:57,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:38:57,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:57,132 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-14 01:38:57,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-14 01:38:57,203 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:38:57,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:57,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:57,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548863574] [2023-02-14 01:38:57,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548863574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:57,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:57,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:38:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012016565] [2023-02-14 01:38:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:57,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:38:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:38:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:57,205 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:57,466 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2023-02-14 01:38:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:38:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-14 01:38:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:57,468 INFO L225 Difference]: With dead ends: 84 [2023-02-14 01:38:57,468 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 01:38:57,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:38:57,469 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 64 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:57,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 99 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 01:38:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2023-02-14 01:38:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2023-02-14 01:38:57,472 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 13 [2023-02-14 01:38:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:57,472 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2023-02-14 01:38:57,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2023-02-14 01:38:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:38:57,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:57,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:57,484 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 (12)] Ended with exit code 0 [2023-02-14 01:38:57,684 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:38:57,685 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1808065813, now seen corresponding path program 1 times [2023-02-14 01:38:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:57,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605977625] [2023-02-14 01:38:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:57,686 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:38:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:57,687 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:38:57,691 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:38:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:57,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:38:57,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:57,768 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:38:57,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:38:57,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605977625] [2023-02-14 01:38:57,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605977625] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:38:57,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:38:57,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:38:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890307278] [2023-02-14 01:38:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:38:57,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:38:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:38:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:38:57,771 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:57,954 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2023-02-14 01:38:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:38:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 01:38:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:57,955 INFO L225 Difference]: With dead ends: 128 [2023-02-14 01:38:57,955 INFO L226 Difference]: Without dead ends: 128 [2023-02-14 01:38:57,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:38:57,956 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 59 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:57,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-14 01:38:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 80. [2023-02-14 01:38:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2023-02-14 01:38:57,959 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 15 [2023-02-14 01:38:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:57,959 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-02-14 01:38:57,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2023-02-14 01:38:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 01:38:57,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:57,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:57,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-14 01:38:58,160 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:38:58,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1221259799, now seen corresponding path program 1 times [2023-02-14 01:38:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:58,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010198919] [2023-02-14 01:38:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:58,161 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:38:58,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:58,167 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:38:58,168 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:38:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:58,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:38:58,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:58,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:38:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:58,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:58,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010198919] [2023-02-14 01:38:58,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010198919] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:38:58,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:38:58,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-14 01:38:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303122591] [2023-02-14 01:38:58,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:38:58,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:38:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:38:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:38:58,407 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:58,832 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2023-02-14 01:38:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:38:58,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 01:38:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:58,834 INFO L225 Difference]: With dead ends: 130 [2023-02-14 01:38:58,834 INFO L226 Difference]: Without dead ends: 130 [2023-02-14 01:38:58,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2023-02-14 01:38:58,835 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 437 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:58,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 170 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:38:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-14 01:38:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2023-02-14 01:38:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-14 01:38:58,837 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 15 [2023-02-14 01:38:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:58,838 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-14 01:38:58,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-14 01:38:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:38:58,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:58,838 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:58,849 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:38:59,039 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:38:59,039 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 262068158, now seen corresponding path program 1 times [2023-02-14 01:38:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500638240] [2023-02-14 01:38:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:59,040 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:38:59,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:59,042 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:38:59,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-14 01:38:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:59,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:38:59,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:38:59,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:38:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:38:59,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:59,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500638240] [2023-02-14 01:38:59,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500638240] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:38:59,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:38:59,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-14 01:38:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681303221] [2023-02-14 01:38:59,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:38:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:38:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:38:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:38:59,224 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:38:59,410 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2023-02-14 01:38:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:38:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 01:38:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:38:59,411 INFO L225 Difference]: With dead ends: 100 [2023-02-14 01:38:59,411 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 01:38:59,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:38:59,412 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:38:59,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 225 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:38:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 01:38:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2023-02-14 01:38:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-02-14 01:38:59,415 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 16 [2023-02-14 01:38:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:38:59,416 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-02-14 01:38:59,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:38:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-02-14 01:38:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 01:38:59,416 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:38:59,417 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:38:59,426 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:38:59,626 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:38:59,627 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:38:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:38:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash -749049092, now seen corresponding path program 1 times [2023-02-14 01:38:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:38:59,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624644919] [2023-02-14 01:38:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:38:59,628 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:38:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:38:59,629 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:38:59,629 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:38:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:38:59,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:38:59,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:38:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:59,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:38:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:38:59,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:38:59,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624644919] [2023-02-14 01:38:59,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624644919] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:38:59,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:38:59,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-02-14 01:38:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422998178] [2023-02-14 01:38:59,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:38:59,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:38:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:38:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:38:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:38:59,942 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:00,328 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2023-02-14 01:39:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 01:39:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 01:39:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:00,329 INFO L225 Difference]: With dead ends: 116 [2023-02-14 01:39:00,329 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 01:39:00,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-02-14 01:39:00,333 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 172 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:00,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 377 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:39:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 01:39:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2023-02-14 01:39:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-02-14 01:39:00,337 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 16 [2023-02-14 01:39:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:00,338 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-02-14 01:39:00,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-02-14 01:39:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-14 01:39:00,339 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:00,339 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] [2023-02-14 01:39:00,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-14 01:39:00,548 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:39:00,548 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:00,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash -302012765, now seen corresponding path program 1 times [2023-02-14 01:39:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:00,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982018809] [2023-02-14 01:39:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:00,549 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:39:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:00,550 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:39:00,551 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:39:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:00,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:39:00,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:39:00,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:00,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-14 01:39:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:39:00,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:00,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982018809] [2023-02-14 01:39:00,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982018809] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:00,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:00,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-14 01:39:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884590518] [2023-02-14 01:39:00,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:00,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:39:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:39:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:39:00,932 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:01,479 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2023-02-14 01:39:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:39:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-14 01:39:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:01,482 INFO L225 Difference]: With dead ends: 151 [2023-02-14 01:39:01,482 INFO L226 Difference]: Without dead ends: 151 [2023-02-14 01:39:01,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:39:01,483 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 235 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:01,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 157 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:39:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-14 01:39:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2023-02-14 01:39:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 104 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2023-02-14 01:39:01,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 20 [2023-02-14 01:39:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:01,488 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2023-02-14 01:39:01,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2023-02-14 01:39:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-14 01:39:01,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:01,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:39:01,500 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:39:01,699 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:39:01,700 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1581646975, now seen corresponding path program 2 times [2023-02-14 01:39:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:01,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214514735] [2023-02-14 01:39:01,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:39:01,701 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:39:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:01,702 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:39:01,703 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:39:01,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:39:01,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:39:01,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:39:01,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:01,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-14 01:39:01,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:39:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:39:01,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:02,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:39:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:39:02,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214514735] [2023-02-14 01:39:02,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214514735] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:02,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:02,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-14 01:39:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473427565] [2023-02-14 01:39:02,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:02,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:39:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:39:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:39:02,249 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:04,199 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2023-02-14 01:39:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:39:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-14 01:39:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:04,200 INFO L225 Difference]: With dead ends: 237 [2023-02-14 01:39:04,200 INFO L226 Difference]: Without dead ends: 237 [2023-02-14 01:39:04,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:39:04,201 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 479 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:04,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 133 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-14 01:39:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-14 01:39:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 169. [2023-02-14 01:39:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 168 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 224 transitions. [2023-02-14 01:39:04,206 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 224 transitions. Word has length 20 [2023-02-14 01:39:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:04,206 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 224 transitions. [2023-02-14 01:39:04,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 224 transitions. [2023-02-14 01:39:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:39:04,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:04,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:39:04,216 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:39:04,407 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:39:04,408 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415948, now seen corresponding path program 1 times [2023-02-14 01:39:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:04,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814823031] [2023-02-14 01:39:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:04,409 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:39:04,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:04,410 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:39:04,411 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:39:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:04,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:39:04,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:04,524 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-14 01:39:04,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-14 01:39:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:39:04,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:39:05,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814823031] [2023-02-14 01:39:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814823031] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:05,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:05,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-14 01:39:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968330795] [2023-02-14 01:39:05,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:05,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:39:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:39:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:39:05,100 INFO L87 Difference]: Start difference. First operand 169 states and 224 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:07,431 INFO L93 Difference]: Finished difference Result 219 states and 260 transitions. [2023-02-14 01:39:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 01:39:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 01:39:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:07,433 INFO L225 Difference]: With dead ends: 219 [2023-02-14 01:39:07,433 INFO L226 Difference]: Without dead ends: 219 [2023-02-14 01:39:07,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2023-02-14 01:39:07,434 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 639 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:07,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 141 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-14 01:39:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-14 01:39:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 184. [2023-02-14 01:39:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 183 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2023-02-14 01:39:07,439 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 21 [2023-02-14 01:39:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:07,439 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2023-02-14 01:39:07,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2023-02-14 01:39:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:39:07,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:07,440 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-14 01:39:07,456 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:39:07,650 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:39:07,651 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 302966996, now seen corresponding path program 2 times [2023-02-14 01:39:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:07,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829760396] [2023-02-14 01:39:07,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:39:07,652 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:39:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:07,653 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:39:07,655 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:39:07,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:39:07,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:39:07,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:39:07,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:07,751 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 8 treesize of output 7 [2023-02-14 01:39:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:39:08,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:39:08,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:08,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829760396] [2023-02-14 01:39:08,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829760396] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:08,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:08,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-14 01:39:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875566866] [2023-02-14 01:39:08,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:08,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 01:39:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 01:39:08,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:39:08,958 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:13,162 INFO L93 Difference]: Finished difference Result 633 states and 856 transitions. [2023-02-14 01:39:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 01:39:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-14 01:39:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:13,165 INFO L225 Difference]: With dead ends: 633 [2023-02-14 01:39:13,165 INFO L226 Difference]: Without dead ends: 633 [2023-02-14 01:39:13,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=327, Invalid=665, Unknown=0, NotChecked=0, Total=992 [2023-02-14 01:39:13,166 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 584 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:13,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 968 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-14 01:39:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2023-02-14 01:39:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 208. [2023-02-14 01:39:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 194 states have (on average 1.407216494845361) internal successors, (273), 207 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 273 transitions. [2023-02-14 01:39:13,173 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 273 transitions. Word has length 22 [2023-02-14 01:39:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:13,174 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 273 transitions. [2023-02-14 01:39:13,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2023-02-14 01:39:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 01:39:13,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:13,175 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:39:13,188 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:39:13,384 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:39:13,384 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1242696241, now seen corresponding path program 1 times [2023-02-14 01:39:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:13,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051352651] [2023-02-14 01:39:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:13,385 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:39:13,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:13,387 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:39:13,390 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:39:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:13,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 01:39:13,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:13,479 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 8 treesize of output 7 [2023-02-14 01:39:13,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-14 01:39:13,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:39:13,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:39:14,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:14,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051352651] [2023-02-14 01:39:14,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051352651] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:14,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:14,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-14 01:39:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138697408] [2023-02-14 01:39:14,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:14,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 01:39:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 01:39:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:39:14,025 INFO L87 Difference]: Start difference. First operand 208 states and 273 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:14,794 INFO L93 Difference]: Finished difference Result 245 states and 308 transitions. [2023-02-14 01:39:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:39:14,794 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 01:39:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:14,795 INFO L225 Difference]: With dead ends: 245 [2023-02-14 01:39:14,795 INFO L226 Difference]: Without dead ends: 245 [2023-02-14 01:39:14,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:39:14,796 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 539 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:14,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 363 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:39:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-14 01:39:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 155. [2023-02-14 01:39:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 154 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2023-02-14 01:39:14,800 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 23 [2023-02-14 01:39:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:14,800 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2023-02-14 01:39:14,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2023-02-14 01:39:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 01:39:14,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:14,801 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] [2023-02-14 01:39:14,812 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:39:15,011 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:39:15,011 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:15,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1547664583, now seen corresponding path program 1 times [2023-02-14 01:39:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:15,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865947568] [2023-02-14 01:39:15,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:15,012 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:39:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:15,013 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:39:15,016 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:39:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:15,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 01:39:15,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:15,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:39:15,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,160 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:39:15,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:39:15,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-02-14 01:39:15,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-02-14 01:39:15,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:39:15,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2023-02-14 01:39:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:39:15,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:15,541 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2023-02-14 01:39:15,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:39:15,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:39:15,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:39:15,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:15,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:39:15,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 99 [2023-02-14 01:39:15,772 INFO L321 Elim1Store]: treesize reduction 132, result has 23.7 percent of original size [2023-02-14 01:39:15,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 119 treesize of output 102 [2023-02-14 01:39:15,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:39:15,917 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 23 treesize of output 9 [2023-02-14 01:39:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:39:16,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:16,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865947568] [2023-02-14 01:39:16,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865947568] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:16,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:16,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-14 01:39:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975739006] [2023-02-14 01:39:16,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:16,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:39:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:39:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2023-02-14 01:39:16,016 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:16,877 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2023-02-14 01:39:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:39:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 01:39:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:16,879 INFO L225 Difference]: With dead ends: 197 [2023-02-14 01:39:16,879 INFO L226 Difference]: Without dead ends: 197 [2023-02-14 01:39:16,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=127, Unknown=1, NotChecked=24, Total=210 [2023-02-14 01:39:16,880 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 93 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:16,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 292 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 54 Unchecked, 0.7s Time] [2023-02-14 01:39:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-14 01:39:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2023-02-14 01:39:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 165 states have (on average 1.4181818181818182) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2023-02-14 01:39:16,884 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 26 [2023-02-14 01:39:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:16,885 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2023-02-14 01:39:16,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2023-02-14 01:39:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:39:16,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:16,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:39:16,897 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:39:17,086 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:39:17,086 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844182, now seen corresponding path program 2 times [2023-02-14 01:39:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:17,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632023294] [2023-02-14 01:39:17,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:39:17,087 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:39:17,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:17,088 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:39:17,090 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:39:17,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 01:39:17,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:39:17,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:39:17,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:17,154 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:39:17,207 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-02-14 01:39:17,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-02-14 01:39:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 01:39:17,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:39:17,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:17,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632023294] [2023-02-14 01:39:17,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632023294] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:39:17,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:39:17,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:39:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313944869] [2023-02-14 01:39:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:39:17,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:39:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:39:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:39:17,248 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:17,344 INFO L93 Difference]: Finished difference Result 177 states and 224 transitions. [2023-02-14 01:39:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:39:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 01:39:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:17,348 INFO L225 Difference]: With dead ends: 177 [2023-02-14 01:39:17,348 INFO L226 Difference]: Without dead ends: 177 [2023-02-14 01:39:17,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:39:17,349 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:17,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:39:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-14 01:39:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-14 01:39:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 165 states have (on average 1.3575757575757577) internal successors, (224), 176 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 224 transitions. [2023-02-14 01:39:17,352 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 224 transitions. Word has length 27 [2023-02-14 01:39:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:17,352 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 224 transitions. [2023-02-14 01:39:17,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 224 transitions. [2023-02-14 01:39:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:39:17,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:17,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:39:17,364 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:39:17,553 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:39:17,553 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844181, now seen corresponding path program 1 times [2023-02-14 01:39:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:17,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312868306] [2023-02-14 01:39:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:17,554 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:39:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:17,557 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:39:17,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 (24)] Waiting until timeout for monitored process [2023-02-14 01:39:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:17,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-14 01:39:17,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:17,697 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 8 treesize of output 7 [2023-02-14 01:39:17,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:39:17,854 INFO L321 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-02-14 01:39:17,854 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 1 case distinctions, treesize of input 28 treesize of output 30 [2023-02-14 01:39:17,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:39:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:39:18,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:39:18,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:39:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:39:19,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312868306] [2023-02-14 01:39:19,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312868306] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:39:19,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:39:19,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2023-02-14 01:39:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344315866] [2023-02-14 01:39:19,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:39:19,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 01:39:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 01:39:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-14 01:39:19,021 INFO L87 Difference]: Start difference. First operand 177 states and 224 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:19,912 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2023-02-14 01:39:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:39:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 01:39:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:19,914 INFO L225 Difference]: With dead ends: 243 [2023-02-14 01:39:19,914 INFO L226 Difference]: Without dead ends: 243 [2023-02-14 01:39:19,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-02-14 01:39:19,914 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 270 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:19,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 198 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:39:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-14 01:39:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 182. [2023-02-14 01:39:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 181 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2023-02-14 01:39:19,918 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 27 [2023-02-14 01:39:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:19,919 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2023-02-14 01:39:19,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2023-02-14 01:39:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 01:39:19,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:19,920 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] [2023-02-14 01:39:19,929 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:39:20,125 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:39:20,125 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -397297604, now seen corresponding path program 1 times [2023-02-14 01:39:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:20,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350097434] [2023-02-14 01:39:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:20,126 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:39:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:20,127 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:39:20,127 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:39:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:20,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:39:20,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 01:39:26,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:39:26,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:26,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350097434] [2023-02-14 01:39:26,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350097434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:39:26,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:39:26,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:39:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740950313] [2023-02-14 01:39:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:39:26,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:39:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:39:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2023-02-14 01:39:26,580 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:28,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:39:30,603 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:39:32,608 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:39:34,617 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:39:36,632 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:39:38,649 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:39:40,765 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:39:42,770 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:39:44,774 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:39:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:45,033 INFO L93 Difference]: Finished difference Result 201 states and 247 transitions. [2023-02-14 01:39:45,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:39:45,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-14 01:39:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:45,035 INFO L225 Difference]: With dead ends: 201 [2023-02-14 01:39:45,035 INFO L226 Difference]: Without dead ends: 176 [2023-02-14 01:39:45,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2023-02-14 01:39:45,036 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:45,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 10 Unknown, 0 Unchecked, 18.4s Time] [2023-02-14 01:39:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-14 01:39:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2023-02-14 01:39:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 164 states have (on average 1.353658536585366) internal successors, (222), 175 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 222 transitions. [2023-02-14 01:39:45,038 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 222 transitions. Word has length 28 [2023-02-14 01:39:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:45,038 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 222 transitions. [2023-02-14 01:39:45,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 222 transitions. [2023-02-14 01:39:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 01:39:45,039 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:45,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:39:45,050 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:39:45,239 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:39:45,240 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 543568764, now seen corresponding path program 1 times [2023-02-14 01:39:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:45,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643114203] [2023-02-14 01:39:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:45,240 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:39:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:45,242 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:39:45,242 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:39:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:45,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:39:45,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 01:39:45,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:39:45,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:45,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643114203] [2023-02-14 01:39:45,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643114203] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:39:45,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:39:45,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:39:45,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588439552] [2023-02-14 01:39:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:39:45,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:39:45,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:39:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:39:45,404 INFO L87 Difference]: Start difference. First operand 176 states and 222 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:39:45,685 INFO L93 Difference]: Finished difference Result 247 states and 311 transitions. [2023-02-14 01:39:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:39:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-14 01:39:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:39:45,687 INFO L225 Difference]: With dead ends: 247 [2023-02-14 01:39:45,687 INFO L226 Difference]: Without dead ends: 247 [2023-02-14 01:39:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:39:45,688 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 223 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:39:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 107 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:39:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-14 01:39:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 179. [2023-02-14 01:39:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 167 states have (on average 1.347305389221557) internal successors, (225), 178 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2023-02-14 01:39:45,698 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 28 [2023-02-14 01:39:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:39:45,698 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2023-02-14 01:39:45,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2023-02-14 01:39:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 01:39:45,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:39:45,699 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] [2023-02-14 01:39:45,709 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 (26)] Forceful destruction successful, exit code 0 [2023-02-14 01:39:45,909 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:39:45,909 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:39:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:39:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -335257990, now seen corresponding path program 1 times [2023-02-14 01:39:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:39:45,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522540898] [2023-02-14 01:39:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:39:45,910 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:39:45,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:39:45,912 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:39:45,916 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:39:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:39:46,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:39:46,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:39:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 01:39:50,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:39:50,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:39:50,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522540898] [2023-02-14 01:39:50,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522540898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:39:50,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:39:50,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:39:50,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864053429] [2023-02-14 01:39:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:39:50,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:39:50,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:39:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:39:50,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2023-02-14 01:39:50,503 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:39:52,509 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:39:54,517 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:39:56,524 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:39:58,531 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:40:00,539 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:40:02,551 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:40:04,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:40:06,563 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:40:08,752 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:40:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:08,753 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2023-02-14 01:40:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:40:08,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-14 01:40:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:08,758 INFO L225 Difference]: With dead ends: 178 [2023-02-14 01:40:08,758 INFO L226 Difference]: Without dead ends: 159 [2023-02-14 01:40:08,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2023-02-14 01:40:08,759 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:08,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 157 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 18.2s Time] [2023-02-14 01:40:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-14 01:40:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-02-14 01:40:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 148 states have (on average 1.364864864864865) internal successors, (202), 158 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2023-02-14 01:40:08,762 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 28 [2023-02-14 01:40:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:08,762 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2023-02-14 01:40:08,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2023-02-14 01:40:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 01:40:08,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:08,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:08,772 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:40:08,963 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:40:08,963 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1430352431, now seen corresponding path program 1 times [2023-02-14 01:40:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128445996] [2023-02-14 01:40:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:40:08,964 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:40:08,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:08,965 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:40:08,967 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:40:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:40:09,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:40:09,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:40:09,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:09,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-02-14 01:40:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:40:09,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128445996] [2023-02-14 01:40:09,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128445996] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:09,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:09,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-14 01:40:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70039398] [2023-02-14 01:40:09,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:09,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:40:09,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:40:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:40:09,473 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:10,367 INFO L93 Difference]: Finished difference Result 389 states and 502 transitions. [2023-02-14 01:40:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 01:40:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 01:40:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:10,369 INFO L225 Difference]: With dead ends: 389 [2023-02-14 01:40:10,370 INFO L226 Difference]: Without dead ends: 389 [2023-02-14 01:40:10,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-02-14 01:40:10,370 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 521 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:10,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 166 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:40:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-02-14 01:40:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 165. [2023-02-14 01:40:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 164 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2023-02-14 01:40:10,374 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 31 [2023-02-14 01:40:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:10,374 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2023-02-14 01:40:10,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2023-02-14 01:40:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:40:10,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:10,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:10,387 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:40:10,575 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:40:10,576 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:10,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1391261449, now seen corresponding path program 1 times [2023-02-14 01:40:10,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:10,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744754942] [2023-02-14 01:40:10,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:40:10,576 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:40:10,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:10,577 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:40:10,578 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:40:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:40:10,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 01:40:10,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 01:40:10,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:40:10,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:10,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744754942] [2023-02-14 01:40:10,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744754942] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:40:10,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:40:10,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:40:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356186058] [2023-02-14 01:40:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:40:10,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:40:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:10,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:40:10,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:40:10,716 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:10,729 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2023-02-14 01:40:10,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:40:10,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 01:40:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:10,731 INFO L225 Difference]: With dead ends: 165 [2023-02-14 01:40:10,731 INFO L226 Difference]: Without dead ends: 165 [2023-02-14 01:40:10,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:40:10,732 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:10,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:40:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-14 01:40:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-02-14 01:40:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 164 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 206 transitions. [2023-02-14 01:40:10,735 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 206 transitions. Word has length 32 [2023-02-14 01:40:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:10,735 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 206 transitions. [2023-02-14 01:40:10,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 206 transitions. [2023-02-14 01:40:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:40:10,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:10,736 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:10,747 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:40:10,937 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:40:10,937 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1391252418, now seen corresponding path program 1 times [2023-02-14 01:40:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:10,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091725354] [2023-02-14 01:40:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:40:10,940 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:40:10,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:10,941 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:40:10,941 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:40:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:40:11,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:40:11,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:40:11,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:11,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-14 01:40:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:40:11,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:11,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091725354] [2023-02-14 01:40:11,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091725354] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:11,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:11,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-14 01:40:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30172726] [2023-02-14 01:40:11,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:11,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:40:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:11,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:40:11,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:40:11,471 INFO L87 Difference]: Start difference. First operand 165 states and 206 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:12,736 INFO L93 Difference]: Finished difference Result 626 states and 789 transitions. [2023-02-14 01:40:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 01:40:12,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 01:40:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:12,738 INFO L225 Difference]: With dead ends: 626 [2023-02-14 01:40:12,738 INFO L226 Difference]: Without dead ends: 626 [2023-02-14 01:40:12,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:40:12,743 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 935 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:12,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 161 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:40:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-02-14 01:40:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 226. [2023-02-14 01:40:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 217 states have (on average 1.3502304147465438) internal successors, (293), 225 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 293 transitions. [2023-02-14 01:40:12,749 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 293 transitions. Word has length 32 [2023-02-14 01:40:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:12,749 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 293 transitions. [2023-02-14 01:40:12,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 293 transitions. [2023-02-14 01:40:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:40:12,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:12,750 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:12,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 (30)] Forceful destruction successful, exit code 0 [2023-02-14 01:40:12,960 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:40:12,960 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 155161166, now seen corresponding path program 3 times [2023-02-14 01:40:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:12,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530531821] [2023-02-14 01:40:12,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 01:40:12,961 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:40:12,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:12,963 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:40:12,965 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:40:13,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 01:40:13,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:40:13,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 01:40:13,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:13,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 01:40:13,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:40:13,366 INFO L321 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2023-02-14 01:40:13,367 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 1 case distinctions, treesize of input 24 treesize of output 30 [2023-02-14 01:40:13,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:40:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:40:13,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:14,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:40:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:40:15,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:15,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530531821] [2023-02-14 01:40:15,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530531821] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:15,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:15,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2023-02-14 01:40:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827583926] [2023-02-14 01:40:15,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-14 01:40:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 01:40:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2023-02-14 01:40:15,398 INFO L87 Difference]: Start difference. First operand 226 states and 293 transitions. Second operand has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:19,364 INFO L93 Difference]: Finished difference Result 346 states and 437 transitions. [2023-02-14 01:40:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 01:40:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 01:40:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:19,366 INFO L225 Difference]: With dead ends: 346 [2023-02-14 01:40:19,366 INFO L226 Difference]: Without dead ends: 324 [2023-02-14 01:40:19,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=361, Invalid=1121, Unknown=0, NotChecked=0, Total=1482 [2023-02-14 01:40:19,366 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 285 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:19,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 331 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-14 01:40:19,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-02-14 01:40:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2023-02-14 01:40:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 292 states have (on average 1.3184931506849316) internal successors, (385), 300 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 385 transitions. [2023-02-14 01:40:19,372 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 385 transitions. Word has length 32 [2023-02-14 01:40:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:19,372 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 385 transitions. [2023-02-14 01:40:19,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 385 transitions. [2023-02-14 01:40:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 01:40:19,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:19,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:19,383 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 (31)] Ended with exit code 0 [2023-02-14 01:40:19,583 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:40:19,584 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 646893308, now seen corresponding path program 1 times [2023-02-14 01:40:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:19,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557336331] [2023-02-14 01:40:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:40:19,585 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:40:19,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:19,587 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:40:19,589 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:40:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:40:19,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:40:19,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 01:40:19,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 01:40:19,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:19,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557336331] [2023-02-14 01:40:19,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557336331] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:19,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:19,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-14 01:40:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093212351] [2023-02-14 01:40:19,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:19,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:40:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:40:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:40:19,810 INFO L87 Difference]: Start difference. First operand 301 states and 385 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:20,021 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2023-02-14 01:40:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:40:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-14 01:40:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:20,023 INFO L225 Difference]: With dead ends: 278 [2023-02-14 01:40:20,023 INFO L226 Difference]: Without dead ends: 273 [2023-02-14 01:40:20,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:40:20,023 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:20,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 128 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:40:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-14 01:40:20,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2023-02-14 01:40:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 256 states have (on average 1.30859375) internal successors, (335), 264 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 335 transitions. [2023-02-14 01:40:20,027 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 335 transitions. Word has length 35 [2023-02-14 01:40:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:20,028 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 335 transitions. [2023-02-14 01:40:20,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 335 transitions. [2023-02-14 01:40:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 01:40:20,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:20,028 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:20,036 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 (32)] Ended with exit code 0 [2023-02-14 01:40:20,233 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:40:20,233 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:20,233 INFO L85 PathProgramCache]: Analyzing trace with hash 770896954, now seen corresponding path program 2 times [2023-02-14 01:40:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:20,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398123293] [2023-02-14 01:40:20,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:40:20,234 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:40:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:20,235 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:40:20,236 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:40:20,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 01:40:20,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:40:20,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:40:20,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:20,373 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:40:20,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2023-02-14 01:40:20,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:40:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-14 01:40:20,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:22,207 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:40:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-14 01:40:22,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:22,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398123293] [2023-02-14 01:40:22,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398123293] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:22,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:22,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2023-02-14 01:40:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552399400] [2023-02-14 01:40:22,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:22,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:40:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:40:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:40:22,211 INFO L87 Difference]: Start difference. First operand 265 states and 335 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:22,747 INFO L93 Difference]: Finished difference Result 268 states and 334 transitions. [2023-02-14 01:40:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:40:22,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 01:40:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:22,749 INFO L225 Difference]: With dead ends: 268 [2023-02-14 01:40:22,749 INFO L226 Difference]: Without dead ends: 243 [2023-02-14 01:40:22,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-14 01:40:22,750 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 101 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:22,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 64 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:40:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-14 01:40:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2023-02-14 01:40:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 214 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 274 transitions. [2023-02-14 01:40:22,753 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 274 transitions. Word has length 37 [2023-02-14 01:40:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:22,753 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 274 transitions. [2023-02-14 01:40:22,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 274 transitions. [2023-02-14 01:40:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 01:40:22,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:22,754 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:22,767 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:40:22,963 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:40:22,963 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash 601007766, now seen corresponding path program 4 times [2023-02-14 01:40:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:22,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301506525] [2023-02-14 01:40:22,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 01:40:22,964 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:40:22,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:22,965 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:40:22,966 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:40:23,100 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 01:40:23,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:40:23,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:40:23,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:23,216 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-14 01:40:23,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-14 01:40:23,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-02-14 01:40:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:40:23,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 01:40:24,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:24,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301506525] [2023-02-14 01:40:24,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301506525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:24,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:24,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2023-02-14 01:40:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609640455] [2023-02-14 01:40:24,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:24,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-14 01:40:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:24,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 01:40:24,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:40:24,405 INFO L87 Difference]: Start difference. First operand 215 states and 274 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:27,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:40:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:30,301 INFO L93 Difference]: Finished difference Result 552 states and 710 transitions. [2023-02-14 01:40:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 01:40:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-14 01:40:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:30,303 INFO L225 Difference]: With dead ends: 552 [2023-02-14 01:40:30,303 INFO L226 Difference]: Without dead ends: 510 [2023-02-14 01:40:30,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2023-02-14 01:40:30,304 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 931 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:30,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 510 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-02-14 01:40:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-02-14 01:40:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 370. [2023-02-14 01:40:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 363 states have (on average 1.3388429752066116) internal successors, (486), 369 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2023-02-14 01:40:30,310 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 40 [2023-02-14 01:40:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:30,310 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2023-02-14 01:40:30,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2023-02-14 01:40:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 01:40:30,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:30,311 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:30,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-14 01:40:30,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:40:30,523 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash -528832743, now seen corresponding path program 5 times [2023-02-14 01:40:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207768846] [2023-02-14 01:40:30,524 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 01:40:30,524 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:40:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:30,525 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:40:30,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-14 01:40:30,878 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-14 01:40:30,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:40:30,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 01:40:30,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:30,902 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 8 treesize of output 7 [2023-02-14 01:40:31,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-14 01:40:31,347 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:40:31,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 01:40:32,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207768846] [2023-02-14 01:40:32,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207768846] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:32,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:32,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-02-14 01:40:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564699459] [2023-02-14 01:40:32,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:32,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 01:40:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:32,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 01:40:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2023-02-14 01:40:32,316 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:35,163 INFO L93 Difference]: Finished difference Result 776 states and 1021 transitions. [2023-02-14 01:40:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 01:40:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-14 01:40:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:35,166 INFO L225 Difference]: With dead ends: 776 [2023-02-14 01:40:35,166 INFO L226 Difference]: Without dead ends: 771 [2023-02-14 01:40:35,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2023-02-14 01:40:35,167 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1000 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:35,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 975 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-14 01:40:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-02-14 01:40:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 637. [2023-02-14 01:40:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 630 states have (on average 1.3444444444444446) internal successors, (847), 636 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 847 transitions. [2023-02-14 01:40:35,176 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 847 transitions. Word has length 44 [2023-02-14 01:40:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:35,177 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 847 transitions. [2023-02-14 01:40:35,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 847 transitions. [2023-02-14 01:40:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 01:40:35,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:35,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:40:35,189 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 (35)] Ended with exit code 0 [2023-02-14 01:40:35,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:40:35,389 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -484234273, now seen corresponding path program 1 times [2023-02-14 01:40:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:35,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804361650] [2023-02-14 01:40:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:40:35,391 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:40:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:35,392 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:40:35,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-14 01:40:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:40:35,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 01:40:35,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:35,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-14 01:40:35,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:40:35,797 INFO L321 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2023-02-14 01:40:35,798 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 1 case distinctions, treesize of input 28 treesize of output 30 [2023-02-14 01:40:35,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:40:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-14 01:40:36,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:37,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:40:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 01:40:38,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:38,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804361650] [2023-02-14 01:40:38,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804361650] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:38,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:38,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-14 01:40:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395091949] [2023-02-14 01:40:38,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 01:40:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 01:40:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:40:38,850 INFO L87 Difference]: Start difference. First operand 637 states and 847 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:40:40,515 INFO L93 Difference]: Finished difference Result 753 states and 1001 transitions. [2023-02-14 01:40:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:40:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 01:40:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:40:40,517 INFO L225 Difference]: With dead ends: 753 [2023-02-14 01:40:40,517 INFO L226 Difference]: Without dead ends: 753 [2023-02-14 01:40:40,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2023-02-14 01:40:40,518 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 503 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:40:40,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 186 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-14 01:40:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2023-02-14 01:40:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 645. [2023-02-14 01:40:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 638 states have (on average 1.3401253918495297) internal successors, (855), 644 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 855 transitions. [2023-02-14 01:40:40,526 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 855 transitions. Word has length 45 [2023-02-14 01:40:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:40:40,526 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 855 transitions. [2023-02-14 01:40:40,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 855 transitions. [2023-02-14 01:40:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:40:40,527 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:40:40,527 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1] [2023-02-14 01:40:40,537 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 (36)] Ended with exit code 0 [2023-02-14 01:40:40,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:40:40,737 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:40:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:40:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1048882662, now seen corresponding path program 3 times [2023-02-14 01:40:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:40:40,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218808208] [2023-02-14 01:40:40,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 01:40:40,738 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:40:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:40:40,740 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:40:40,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-14 01:40:40,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-14 01:40:40,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:40:40,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:40:40,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:40:40,969 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 8 treesize of output 7 [2023-02-14 01:40:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:40:41,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:40:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:40:44,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:40:44,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218808208] [2023-02-14 01:40:44,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218808208] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:40:44,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:40:44,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-02-14 01:40:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231907986] [2023-02-14 01:40:44,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:40:44,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 01:40:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:40:44,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 01:40:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2023-02-14 01:40:44,534 INFO L87 Difference]: Start difference. First operand 645 states and 855 transitions. Second operand has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:40:51,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:41:09,857 INFO L93 Difference]: Finished difference Result 1888 states and 2479 transitions. [2023-02-14 01:41:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 01:41:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 01:41:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:41:09,862 INFO L225 Difference]: With dead ends: 1888 [2023-02-14 01:41:09,862 INFO L226 Difference]: Without dead ends: 1888 [2023-02-14 01:41:09,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=1194, Invalid=2588, Unknown=0, NotChecked=0, Total=3782 [2023-02-14 01:41:09,863 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 2543 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:41:09,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 2831 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-02-14 01:41:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2023-02-14 01:41:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 693. [2023-02-14 01:41:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 686 states have (on average 1.3338192419825072) internal successors, (915), 692 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 915 transitions. [2023-02-14 01:41:09,876 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 915 transitions. Word has length 46 [2023-02-14 01:41:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:41:09,876 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 915 transitions. [2023-02-14 01:41:09,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 915 transitions. [2023-02-14 01:41:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:41:09,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:41:09,877 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:41:09,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-14 01:41:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:41:10,087 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:41:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:41:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1686115654, now seen corresponding path program 1 times [2023-02-14 01:41:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:41:10,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745087713] [2023-02-14 01:41:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:41:10,088 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:41:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:41:10,089 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:41:10,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-14 01:41:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:41:10,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:41:10,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:41:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 01:41:10,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:41:11,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-02-14 01:41:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-14 01:41:11,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:41:11,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745087713] [2023-02-14 01:41:11,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745087713] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:41:11,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:41:11,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-14 01:41:11,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493922008] [2023-02-14 01:41:11,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:41:11,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 01:41:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:41:11,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 01:41:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:41:11,389 INFO L87 Difference]: Start difference. First operand 693 states and 915 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:41:19,727 INFO L93 Difference]: Finished difference Result 1689 states and 2241 transitions. [2023-02-14 01:41:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-14 01:41:19,728 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 01:41:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:41:19,732 INFO L225 Difference]: With dead ends: 1689 [2023-02-14 01:41:19,732 INFO L226 Difference]: Without dead ends: 1689 [2023-02-14 01:41:19,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2023-02-14 01:41:19,733 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1185 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:41:19,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 339 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-02-14 01:41:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2023-02-14 01:41:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 900. [2023-02-14 01:41:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 893 states have (on average 1.347144456886898) internal successors, (1203), 899 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1203 transitions. [2023-02-14 01:41:19,753 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1203 transitions. Word has length 46 [2023-02-14 01:41:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:41:19,753 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1203 transitions. [2023-02-14 01:41:19,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1203 transitions. [2023-02-14 01:41:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:41:19,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:41:19,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:41:19,763 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 (38)] Ended with exit code 0 [2023-02-14 01:41:19,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:41:19,961 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:41:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:41:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2126360568, now seen corresponding path program 1 times [2023-02-14 01:41:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:41:19,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680011981] [2023-02-14 01:41:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:41:19,962 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:41:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:41:19,963 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:41:19,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-14 01:41:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:41:20,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:41:20,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:41:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-14 01:41:20,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:41:20,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-02-14 01:41:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-14 01:41:20,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:41:20,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680011981] [2023-02-14 01:41:20,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680011981] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:41:20,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:41:20,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-14 01:41:20,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87138047] [2023-02-14 01:41:20,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:41:20,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:41:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:41:20,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:41:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:41:20,700 INFO L87 Difference]: Start difference. First operand 900 states and 1203 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:41:21,487 INFO L93 Difference]: Finished difference Result 1116 states and 1410 transitions. [2023-02-14 01:41:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:41:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-14 01:41:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:41:21,490 INFO L225 Difference]: With dead ends: 1116 [2023-02-14 01:41:21,490 INFO L226 Difference]: Without dead ends: 1116 [2023-02-14 01:41:21,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2023-02-14 01:41:21,491 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 418 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:41:21,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 146 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:41:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2023-02-14 01:41:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 900. [2023-02-14 01:41:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 893 states have (on average 1.3012318029115342) internal successors, (1162), 899 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1162 transitions. [2023-02-14 01:41:21,503 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1162 transitions. Word has length 46 [2023-02-14 01:41:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:41:21,504 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 1162 transitions. [2023-02-14 01:41:21,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1162 transitions. [2023-02-14 01:41:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 01:41:21,505 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:41:21,505 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:41:21,516 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 (39)] Ended with exit code 0 [2023-02-14 01:41:21,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:41:21,716 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:41:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:41:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash 274247196, now seen corresponding path program 6 times [2023-02-14 01:41:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:41:21,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849329104] [2023-02-14 01:41:21,717 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 01:41:21,717 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:41:21,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:41:21,718 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:41:21,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-14 01:41:21,985 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-14 01:41:21,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:41:21,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 01:41:21,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:41:22,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:41:22,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-14 01:41:22,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:41:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-14 01:41:22,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:41:23,744 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:41:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-14 01:41:23,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:41:23,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849329104] [2023-02-14 01:41:23,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849329104] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:41:23,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:41:23,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-14 01:41:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86712987] [2023-02-14 01:41:23,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:41:23,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 01:41:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:41:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 01:41:23,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:41:23,918 INFO L87 Difference]: Start difference. First operand 900 states and 1162 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:30,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:32,770 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 [] [2023-02-14 01:41:35,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:37,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:40,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:42,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:44,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:47,678 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 [] [2023-02-14 01:41:50,402 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 [] [2023-02-14 01:41:54,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-14 01:41:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:41:57,426 INFO L93 Difference]: Finished difference Result 2516 states and 3263 transitions. [2023-02-14 01:41:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-14 01:41:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-14 01:41:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:41:57,433 INFO L225 Difference]: With dead ends: 2516 [2023-02-14 01:41:57,433 INFO L226 Difference]: Without dead ends: 2487 [2023-02-14 01:41:57,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=657, Invalid=1793, Unknown=0, NotChecked=0, Total=2450 [2023-02-14 01:41:57,434 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 1170 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 129 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:41:57,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 799 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1630 Invalid, 5 Unknown, 0 Unchecked, 28.8s Time] [2023-02-14 01:41:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2023-02-14 01:41:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 1930. [2023-02-14 01:41:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1923 states have (on average 1.328133125325013) internal successors, (2554), 1929 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2554 transitions. [2023-02-14 01:41:57,478 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2554 transitions. Word has length 48 [2023-02-14 01:41:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:41:57,478 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 2554 transitions. [2023-02-14 01:41:57,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:41:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2554 transitions. [2023-02-14 01:41:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 01:41:57,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:41:57,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:41:57,493 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 (40)] Forceful destruction successful, exit code 0 [2023-02-14 01:41:57,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:41:57,692 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:41:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:41:57,693 INFO L85 PathProgramCache]: Analyzing trace with hash 971260211, now seen corresponding path program 2 times [2023-02-14 01:41:57,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:41:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829201283] [2023-02-14 01:41:57,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:41:57,693 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:41:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:41:57,694 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:41:57,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-14 01:41:57,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 01:41:57,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:41:57,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 01:41:57,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:41:57,810 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 8 treesize of output 7 [2023-02-14 01:41:57,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:41:57,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:41:58,006 INFO L321 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2023-02-14 01:41:58,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:41:58,019 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:41:58,020 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:41:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-14 01:41:58,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:42:05,213 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 01:42:05,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:42:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-14 01:42:06,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:42:06,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829201283] [2023-02-14 01:42:06,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829201283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:42:06,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:42:06,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-14 01:42:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718962294] [2023-02-14 01:42:06,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:42:06,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:42:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:42:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:42:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:42:06,141 INFO L87 Difference]: Start difference. First operand 1930 states and 2554 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:42:06,777 INFO L93 Difference]: Finished difference Result 1963 states and 2550 transitions. [2023-02-14 01:42:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:42:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-14 01:42:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:42:06,782 INFO L225 Difference]: With dead ends: 1963 [2023-02-14 01:42:06,782 INFO L226 Difference]: Without dead ends: 1963 [2023-02-14 01:42:06,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-02-14 01:42:06,783 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 214 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:42:06,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 48 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:42:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2023-02-14 01:42:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1921. [2023-02-14 01:42:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1915 states have (on average 1.3080939947780679) internal successors, (2505), 1920 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2505 transitions. [2023-02-14 01:42:06,814 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2505 transitions. Word has length 48 [2023-02-14 01:42:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:42:06,814 INFO L495 AbstractCegarLoop]: Abstraction has 1921 states and 2505 transitions. [2023-02-14 01:42:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2505 transitions. [2023-02-14 01:42:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-14 01:42:06,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:42:06,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:42:06,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-02-14 01:42:07,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:42:07,025 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:42:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:42:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2107734792, now seen corresponding path program 2 times [2023-02-14 01:42:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:42:07,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3533956] [2023-02-14 01:42:07,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:42:07,026 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:42:07,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:42:07,027 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:42:07,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-14 01:42:07,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:42:07,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:42:07,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:42:07,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:42:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-14 01:42:07,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:42:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-14 01:42:07,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:42:07,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3533956] [2023-02-14 01:42:07,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3533956] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:42:07,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:42:07,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-14 01:42:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982218791] [2023-02-14 01:42:07,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:42:07,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:42:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:42:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:42:07,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:42:07,539 INFO L87 Difference]: Start difference. First operand 1921 states and 2505 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:42:08,491 INFO L93 Difference]: Finished difference Result 1991 states and 2548 transitions. [2023-02-14 01:42:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:42:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-02-14 01:42:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:42:08,496 INFO L225 Difference]: With dead ends: 1991 [2023-02-14 01:42:08,497 INFO L226 Difference]: Without dead ends: 1991 [2023-02-14 01:42:08,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:42:08,497 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 149 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:42:08,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 265 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 01:42:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2023-02-14 01:42:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1929. [2023-02-14 01:42:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1923 states have (on average 1.2886115444617785) internal successors, (2478), 1928 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2478 transitions. [2023-02-14 01:42:08,525 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2478 transitions. Word has length 60 [2023-02-14 01:42:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:42:08,525 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 2478 transitions. [2023-02-14 01:42:08,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2478 transitions. [2023-02-14 01:42:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-14 01:42:08,527 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:42:08,527 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:42:08,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-14 01:42:08,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:42:08,738 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:42:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:42:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash -370900910, now seen corresponding path program 2 times [2023-02-14 01:42:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:42:08,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68927414] [2023-02-14 01:42:08,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:42:08,739 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:42:08,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:42:08,740 INFO L229 MonitoredProcess]: Starting monitored process 43 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:42:08,741 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 (43)] Waiting until timeout for monitored process [2023-02-14 01:42:08,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:42:08,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:42:08,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:42:08,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:42:09,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:42:09,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-14 01:42:09,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 01:42:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-14 01:42:10,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:42:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-14 01:42:11,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:42:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68927414] [2023-02-14 01:42:11,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68927414] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:42:11,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:42:11,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2023-02-14 01:42:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067616962] [2023-02-14 01:42:11,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:42:11,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-14 01:42:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:42:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 01:42:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2023-02-14 01:42:11,598 INFO L87 Difference]: Start difference. First operand 1929 states and 2478 transitions. Second operand has 21 states, 20 states have (on average 4.7) internal successors, (94), 21 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:42:22,902 INFO L93 Difference]: Finished difference Result 4468 states and 5786 transitions. [2023-02-14 01:42:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 01:42:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 21 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-02-14 01:42:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:42:22,915 INFO L225 Difference]: With dead ends: 4468 [2023-02-14 01:42:22,916 INFO L226 Difference]: Without dead ends: 4468 [2023-02-14 01:42:22,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=449, Invalid=1713, Unknown=0, NotChecked=0, Total=2162 [2023-02-14 01:42:22,917 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 950 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:42:22,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 766 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-02-14 01:42:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2023-02-14 01:42:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 2987. [2023-02-14 01:42:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2981 states have (on average 1.3129822207312982) internal successors, (3914), 2986 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3914 transitions. [2023-02-14 01:42:22,954 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3914 transitions. Word has length 70 [2023-02-14 01:42:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:42:22,961 INFO L495 AbstractCegarLoop]: Abstraction has 2987 states and 3914 transitions. [2023-02-14 01:42:22,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.7) internal successors, (94), 21 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3914 transitions. [2023-02-14 01:42:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-02-14 01:42:22,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:42:22,962 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:42:22,972 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 (43)] Ended with exit code 0 [2023-02-14 01:42:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:42:23,163 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:42:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:42:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1749548629, now seen corresponding path program 3 times [2023-02-14 01:42:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:42:23,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119262155] [2023-02-14 01:42:23,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 01:42:23,164 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:42:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:42:23,165 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:42:23,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-02-14 01:42:23,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 01:42:23,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:42:23,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:42:23,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:42:23,546 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-14 01:42:23,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-14 01:42:24,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-14 01:42:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-02-14 01:42:24,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:42:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2023-02-14 01:42:27,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:42:27,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119262155] [2023-02-14 01:42:27,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119262155] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:42:27,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:42:27,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-14 01:42:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505959407] [2023-02-14 01:42:27,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:42:27,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 01:42:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:42:27,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 01:42:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:42:27,698 INFO L87 Difference]: Start difference. First operand 2987 states and 3914 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:42:32,927 INFO L93 Difference]: Finished difference Result 6604 states and 8628 transitions. [2023-02-14 01:42:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 01:42:32,929 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-02-14 01:42:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:42:32,949 INFO L225 Difference]: With dead ends: 6604 [2023-02-14 01:42:32,950 INFO L226 Difference]: Without dead ends: 6604 [2023-02-14 01:42:32,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=397, Invalid=793, Unknown=0, NotChecked=0, Total=1190 [2023-02-14 01:42:32,951 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1134 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:42:32,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 173 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-14 01:42:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6604 states. [2023-02-14 01:42:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6604 to 2985. [2023-02-14 01:42:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2979 states have (on average 1.3115139308492783) internal successors, (3907), 2984 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 3907 transitions. [2023-02-14 01:42:33,015 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 3907 transitions. Word has length 74 [2023-02-14 01:42:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:42:33,015 INFO L495 AbstractCegarLoop]: Abstraction has 2985 states and 3907 transitions. [2023-02-14 01:42:33,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:42:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3907 transitions. [2023-02-14 01:42:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-14 01:42:33,018 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:42:33,018 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:42:33,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-02-14 01:42:33,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:42:33,234 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-14 01:42:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:42:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1746122625, now seen corresponding path program 7 times [2023-02-14 01:42:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:42:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120760960] [2023-02-14 01:42:33,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 01:42:33,235 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:42:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:42:33,236 INFO L229 MonitoredProcess]: Starting monitored process 45 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:42:33,240 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 (45)] Waiting until timeout for monitored process [2023-02-14 01:42:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:42:33,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 01:42:33,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:42:33,846 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-02-14 01:42:33,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2023-02-14 01:42:34,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-02-14 01:42:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 155 proven. 100 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-02-14 01:42:34,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:42:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 163 proven. 92 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-02-14 01:42:36,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:42:36,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120760960] [2023-02-14 01:42:36,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120760960] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:42:36,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:42:36,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-02-14 01:42:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524706061] [2023-02-14 01:42:36,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:42:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 01:42:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:42:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 01:42:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2023-02-14 01:42:36,454 INFO L87 Difference]: Start difference. First operand 2985 states and 3907 transitions. Second operand has 32 states, 32 states have (on average 3.15625) internal successors, (101), 32 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)