./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:09:12,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:09:12,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:09:12,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:09:12,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:09:12,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:09:12,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:09:12,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:09:12,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:09:12,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:09:12,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:09:12,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:09:12,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:09:12,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:09:12,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:09:12,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:09:12,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:09:12,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:09:12,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:09:12,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:09:12,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:09:12,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:09:12,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:09:12,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:09:12,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:09:12,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:09:12,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:09:12,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:09:12,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:09:12,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:09:12,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:09:12,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:09:12,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:09:12,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:09:12,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:09:12,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:09:12,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:09:12,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:09:12,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:09:12,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:09:12,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:09:12,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:09:12,436 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:09:12,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:09:12,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:09:12,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:09:12,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:09:12,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:09:12,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:09:12,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:09:12,439 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:09:12,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:09:12,440 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:09:12,440 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:09:12,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:09:12,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:09:12,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:09:12,441 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:09:12,441 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:09:12,442 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:09:12,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:09:12,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:09:12,442 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:09:12,442 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:09:12,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:09:12,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:09:12,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:09:12,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:09:12,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:09:12,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:09:12,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:09:12,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:09:12,444 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:09:12,445 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:09:12,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:09:12,456 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:09:12,456 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2023-02-16 03:09:12,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:09:12,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:09:12,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:09:12,704 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:09:12,704 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:09:12,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2023-02-16 03:09:13,926 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:09:14,157 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:09:14,158 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2023-02-16 03:09:14,170 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb310091d/addb01f72eb4426e9368985fd3aef937/FLAG3548a6682 [2023-02-16 03:09:14,182 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb310091d/addb01f72eb4426e9368985fd3aef937 [2023-02-16 03:09:14,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:09:14,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:09:14,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:09:14,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:09:14,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:09:14,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:09:14" (1/1) ... [2023-02-16 03:09:14,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53670fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:14, skipping insertion in model container [2023-02-16 03:09:14,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:09:14" (1/1) ... [2023-02-16 03:09:14,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:09:14,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:09:14,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:09:14,742 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-16 03:09:14,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d75447f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:14, skipping insertion in model container [2023-02-16 03:09:14,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:09:14,745 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:09:14,747 INFO L158 Benchmark]: Toolchain (without parser) took 560.41ms. Allocated memory is still 136.3MB. Free memory was 87.1MB in the beginning and 72.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:09:14,748 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:09:14,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.48ms. Allocated memory is still 136.3MB. Free memory was 87.1MB in the beginning and 72.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:09:14,750 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 136.3MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.48ms. Allocated memory is still 136.3MB. Free memory was 87.1MB in the beginning and 72.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:09:16,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:09:16,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:09:16,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:09:16,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:09:16,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:09:16,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:09:16,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:09:16,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:09:16,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:09:16,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:09:16,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:09:16,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:09:16,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:09:16,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:09:16,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:09:16,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:09:16,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:09:16,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:09:16,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:09:16,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:09:16,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:09:16,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:09:16,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:09:16,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:09:16,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:09:16,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:09:16,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:09:16,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:09:16,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:09:16,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:09:16,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:09:16,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:09:16,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:09:16,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:09:16,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:09:16,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:09:16,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:09:16,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:09:16,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:09:16,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:09:16,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:09:16,796 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:09:16,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:09:16,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:09:16,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:09:16,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:09:16,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:09:16,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:09:16,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:09:16,799 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:09:16,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:09:16,800 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:09:16,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:09:16,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:09:16,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:09:16,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:09:16,801 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:09:16,802 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:09:16,802 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:09:16,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:09:16,802 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:09:16,802 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:09:16,803 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:09:16,803 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:09:16,803 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:09:16,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:09:16,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:09:16,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:09:16,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:09:16,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:09:16,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:09:16,805 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:09:16,805 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:09:16,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:09:16,805 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:09:16,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:09:16,806 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:09:16,806 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:09:16,806 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2023-02-16 03:09:17,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:09:17,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:09:17,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:09:17,190 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:09:17,191 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:09:17,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2023-02-16 03:09:18,397 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:09:18,749 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:09:18,749 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2023-02-16 03:09:18,772 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5afb0807d/ba65c9b562c84ef48fd34c1e9efc3761/FLAG8a7c3efaf [2023-02-16 03:09:18,792 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5afb0807d/ba65c9b562c84ef48fd34c1e9efc3761 [2023-02-16 03:09:18,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:09:18,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:09:18,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:09:18,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:09:18,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:09:18,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:09:18" (1/1) ... [2023-02-16 03:09:18,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab781a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:18, skipping insertion in model container [2023-02-16 03:09:18,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:09:18" (1/1) ... [2023-02-16 03:09:18,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:09:18,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:09:19,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:09:19,322 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:09:19,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:09:19,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:09:19,378 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:09:19,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:09:19,490 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:09:19,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19 WrapperNode [2023-02-16 03:09:19,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:09:19,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:09:19,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:09:19,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:09:19,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,569 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-02-16 03:09:19,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:09:19,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:09:19,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:09:19,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:09:19,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,628 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:09:19,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:09:19,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:09:19,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:09:19,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (1/1) ... [2023-02-16 03:09:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:09:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:09:19,674 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-16 03:09:19,696 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-16 03:09:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2023-02-16 03:09:19,715 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2023-02-16 03:09:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 03:09:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:09:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:09:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2023-02-16 03:09:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2023-02-16 03:09:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2023-02-16 03:09:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2023-02-16 03:09:19,717 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2023-02-16 03:09:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2023-02-16 03:09:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:09:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:09:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:09:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2023-02-16 03:09:19,718 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2023-02-16 03:09:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2023-02-16 03:09:19,719 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2023-02-16 03:09:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:09:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:09:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:09:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2023-02-16 03:09:19,719 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2023-02-16 03:09:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2023-02-16 03:09:19,720 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2023-02-16 03:09:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:09:19,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:09:19,926 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:09:19,928 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:09:20,459 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:09:20,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:09:20,466 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 03:09:20,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:09:20 BoogieIcfgContainer [2023-02-16 03:09:20,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:09:20,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:09:20,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:09:20,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:09:20,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:09:18" (1/3) ... [2023-02-16 03:09:20,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27272809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:09:20, skipping insertion in model container [2023-02-16 03:09:20,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:09:19" (2/3) ... [2023-02-16 03:09:20,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27272809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:09:20, skipping insertion in model container [2023-02-16 03:09:20,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:09:20" (3/3) ... [2023-02-16 03:09:20,476 INFO L112 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2023-02-16 03:09:20,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:09:20,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2023-02-16 03:09:20,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:09:20,534 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;@662cb975, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:09:20,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2023-02-16 03:09:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:09:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:09:20,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:20,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:09:20,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash 228226931, now seen corresponding path program 1 times [2023-02-16 03:09:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:20,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257640678] [2023-02-16 03:09:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:20,569 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-16 03:09:20,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:20,581 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-16 03:09:20,585 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-16 03:09:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:20,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:09:20,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:20,759 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-16 03:09:20,772 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-16 03:09:20,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:20,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257640678] [2023-02-16 03:09:20,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257640678] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:20,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:20,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407949441] [2023-02-16 03:09:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:20,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:20,818 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:21,130 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2023-02-16 03:09:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:21,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:09:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:21,146 INFO L225 Difference]: With dead ends: 182 [2023-02-16 03:09:21,147 INFO L226 Difference]: Without dead ends: 180 [2023-02-16 03:09:21,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:21,152 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:21,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 344 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:09:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-16 03:09:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-02-16 03:09:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:09:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2023-02-16 03:09:21,226 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2023-02-16 03:09:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:21,227 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2023-02-16 03:09:21,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2023-02-16 03:09:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:09:21,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:21,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:09:21,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-16 03:09:21,437 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-16 03:09:21,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:21,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 228226932, now seen corresponding path program 1 times [2023-02-16 03:09:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:21,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842074248] [2023-02-16 03:09:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:21,440 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-16 03:09:21,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:21,441 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-16 03:09:21,442 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-16 03:09:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:21,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:09:21,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:21,566 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-16 03:09:21,580 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-16 03:09:21,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:21,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842074248] [2023-02-16 03:09:21,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842074248] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:21,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:21,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:09:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37889396] [2023-02-16 03:09:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:21,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:09:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:09:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:21,589 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:21,921 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2023-02-16 03:09:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-16 03:09:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:21,925 INFO L225 Difference]: With dead ends: 184 [2023-02-16 03:09:21,925 INFO L226 Difference]: Without dead ends: 184 [2023-02-16 03:09:21,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:09:21,927 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:21,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:09:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-16 03:09:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2023-02-16 03:09:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:09:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2023-02-16 03:09:21,941 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2023-02-16 03:09:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:21,941 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2023-02-16 03:09:21,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2023-02-16 03:09:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:09:21,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:21,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:21,955 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-16 03:09:22,151 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-16 03:09:22,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 282747829, now seen corresponding path program 1 times [2023-02-16 03:09:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:22,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656020951] [2023-02-16 03:09:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:22,154 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-16 03:09:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:22,155 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-16 03:09:22,156 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-16 03:09:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:22,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:09:22,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:22,236 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-16 03:09:22,242 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-16 03:09:22,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:09:22,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:09:22,286 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:09:22,286 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-16 03:09:22,301 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-16 03:09:22,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:22,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:22,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656020951] [2023-02-16 03:09:22,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656020951] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:22,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:22,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:09:22,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591541123] [2023-02-16 03:09:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:22,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:09:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:09:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:09:22,304 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:22,585 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2023-02-16 03:09:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:09:22,587 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 03:09:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:22,588 INFO L225 Difference]: With dead ends: 177 [2023-02-16 03:09:22,588 INFO L226 Difference]: Without dead ends: 177 [2023-02-16 03:09:22,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:09:22,589 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:22,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 342 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:09:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-16 03:09:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2023-02-16 03:09:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:09:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2023-02-16 03:09:22,598 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2023-02-16 03:09:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:22,599 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2023-02-16 03:09:22,599 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2023-02-16 03:09:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:09:22,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:22,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:22,618 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-16 03:09:22,818 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-16 03:09:22,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1865414411, now seen corresponding path program 1 times [2023-02-16 03:09:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:22,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006400123] [2023-02-16 03:09:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:22,820 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-16 03:09:22,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:22,822 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-16 03:09:22,827 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-16 03:09:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:22,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:09:22,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:22,908 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-16 03:09:22,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:09:22,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-16 03:09:22,954 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-16 03:09:22,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:22,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:22,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006400123] [2023-02-16 03:09:22,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006400123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:22,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:22,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:09:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126704563] [2023-02-16 03:09:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:22,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:09:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:09:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:09:22,957 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:23,629 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2023-02-16 03:09:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:09:23,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-16 03:09:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:23,632 INFO L225 Difference]: With dead ends: 186 [2023-02-16 03:09:23,632 INFO L226 Difference]: Without dead ends: 186 [2023-02-16 03:09:23,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:09:23,634 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:23,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 811 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:09:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-16 03:09:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2023-02-16 03:09:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:09:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2023-02-16 03:09:23,644 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2023-02-16 03:09:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:23,644 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2023-02-16 03:09:23,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2023-02-16 03:09:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:09:23,645 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:23,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:23,654 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-16 03:09:23,854 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-16 03:09:23,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271845, now seen corresponding path program 1 times [2023-02-16 03:09:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:23,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655482809] [2023-02-16 03:09:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:23,856 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-16 03:09:23,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:23,858 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-16 03:09:23,864 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-16 03:09:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:23,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 03:09:23,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:23,955 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 10 treesize of output 9 [2023-02-16 03:09:23,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:09:23,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:09:24,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:09:24,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-16 03:09:24,094 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-16 03:09:24,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:24,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655482809] [2023-02-16 03:09:24,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655482809] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:24,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:24,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:09:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314598201] [2023-02-16 03:09:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:09:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:09:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:09:24,098 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:24,925 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2023-02-16 03:09:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:09:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-16 03:09:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:24,928 INFO L225 Difference]: With dead ends: 197 [2023-02-16 03:09:24,928 INFO L226 Difference]: Without dead ends: 197 [2023-02-16 03:09:24,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:09:24,929 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 62 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:24,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1053 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:09:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-16 03:09:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2023-02-16 03:09:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:09:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2023-02-16 03:09:24,938 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2023-02-16 03:09:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:24,938 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2023-02-16 03:09:24,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:09:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2023-02-16 03:09:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:09:24,939 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:24,939 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] [2023-02-16 03:09:24,950 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-16 03:09:25,147 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-16 03:09:25,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash 335042805, now seen corresponding path program 1 times [2023-02-16 03:09:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:25,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148354216] [2023-02-16 03:09:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:25,149 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-16 03:09:25,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:25,150 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-16 03:09:25,152 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-16 03:09:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:25,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:09:25,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:25,314 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-16 03:09:25,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:25,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:25,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148354216] [2023-02-16 03:09:25,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148354216] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:25,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:25,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:09:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241155295] [2023-02-16 03:09:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:25,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:09:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:09:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:09:25,317 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:09:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:25,494 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2023-02-16 03:09:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:09:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-16 03:09:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:25,498 INFO L225 Difference]: With dead ends: 209 [2023-02-16 03:09:25,499 INFO L226 Difference]: Without dead ends: 203 [2023-02-16 03:09:25,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:09:25,499 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 44 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:25,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 757 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:09:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-16 03:09:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2023-02-16 03:09:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 156 states have internal predecessors, (164), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-16 03:09:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2023-02-16 03:09:25,510 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 21 [2023-02-16 03:09:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:25,511 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2023-02-16 03:09:25,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:09:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2023-02-16 03:09:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:09:25,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:25,517 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] [2023-02-16 03:09:25,525 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-16 03:09:25,725 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-16 03:09:25,725 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 370721495, now seen corresponding path program 1 times [2023-02-16 03:09:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:25,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977300230] [2023-02-16 03:09:25,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:25,726 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-16 03:09:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:25,728 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-16 03:09:25,732 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-16 03:09:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:25,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:09:25,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:25,945 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-16 03:09:25,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:26,139 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-16 03:09:26,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:26,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977300230] [2023-02-16 03:09:26,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977300230] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:26,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:09:26,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 03:09:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267336230] [2023-02-16 03:09:26,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:26,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:09:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:09:26,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:09:26,142 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:09:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:26,674 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2023-02-16 03:09:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:09:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-16 03:09:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:26,677 INFO L225 Difference]: With dead ends: 246 [2023-02-16 03:09:26,677 INFO L226 Difference]: Without dead ends: 234 [2023-02-16 03:09:26,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2023-02-16 03:09:26,678 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 123 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:26,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1351 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:09:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-16 03:09:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2023-02-16 03:09:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 127 states have (on average 1.4960629921259843) internal successors, (190), 173 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-16 03:09:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2023-02-16 03:09:26,695 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 22 [2023-02-16 03:09:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:26,695 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2023-02-16 03:09:26,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:09:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2023-02-16 03:09:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:09:26,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:26,697 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:26,707 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-16 03:09:26,907 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-16 03:09:26,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:26,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -843792011, now seen corresponding path program 2 times [2023-02-16 03:09:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:26,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425665678] [2023-02-16 03:09:26,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:09:26,908 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-16 03:09:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:26,909 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-16 03:09:26,918 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-16 03:09:27,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 03:09:27,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:09:27,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:09:27,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 03:09:27,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:27,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:27,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425665678] [2023-02-16 03:09:27,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425665678] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:27,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:27,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:09:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146254669] [2023-02-16 03:09:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:27,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:09:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:27,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:09:27,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:09:27,070 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:09:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:27,490 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2023-02-16 03:09:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:09:27,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-16 03:09:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:27,492 INFO L225 Difference]: With dead ends: 214 [2023-02-16 03:09:27,492 INFO L226 Difference]: Without dead ends: 214 [2023-02-16 03:09:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:09:27,493 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 756 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:09:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-16 03:09:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-02-16 03:09:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-16 03:09:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2023-02-16 03:09:27,502 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 25 [2023-02-16 03:09:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:27,504 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2023-02-16 03:09:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:09:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2023-02-16 03:09:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:09:27,505 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:27,505 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:27,542 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-16 03:09:27,715 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-16 03:09:27,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash -843792010, now seen corresponding path program 1 times [2023-02-16 03:09:27,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:27,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937375312] [2023-02-16 03:09:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:27,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:09:27,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:27,718 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-16 03:09:27,722 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-16 03:09:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:27,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:09:27,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:28,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:09:28,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:28,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937375312] [2023-02-16 03:09:28,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937375312] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:28,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:09:28,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-16 03:09:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699380113] [2023-02-16 03:09:28,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 03:09:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 03:09:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:09:28,351 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:09:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:29,683 INFO L93 Difference]: Finished difference Result 285 states and 358 transitions. [2023-02-16 03:09:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:09:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-16 03:09:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:29,685 INFO L225 Difference]: With dead ends: 285 [2023-02-16 03:09:29,685 INFO L226 Difference]: Without dead ends: 267 [2023-02-16 03:09:29,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2023-02-16 03:09:29,687 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 165 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:29,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1817 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 03:09:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-16 03:09:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 222. [2023-02-16 03:09:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 179 states have internal predecessors, (193), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-16 03:09:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2023-02-16 03:09:29,697 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 25 [2023-02-16 03:09:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:29,697 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2023-02-16 03:09:29,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:09:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2023-02-16 03:09:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:09:29,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:29,698 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:29,716 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-16 03:09:29,915 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-16 03:09:29,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 168356342, now seen corresponding path program 2 times [2023-02-16 03:09:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693989780] [2023-02-16 03:09:29,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:09:29,916 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-16 03:09:29,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:29,918 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-16 03:09:29,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-16 03:09:30,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 03:09:30,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:09:30,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:09:30,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-16 03:09:30,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:09:30,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:30,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693989780] [2023-02-16 03:09:30,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693989780] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:09:30,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:09:30,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:09:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214087386] [2023-02-16 03:09:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:09:30,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:09:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:09:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:09:30,211 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:09:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:30,678 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2023-02-16 03:09:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:09:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-02-16 03:09:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:30,682 INFO L225 Difference]: With dead ends: 220 [2023-02-16 03:09:30,682 INFO L226 Difference]: Without dead ends: 220 [2023-02-16 03:09:30,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:09:30,683 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:30,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 809 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:09:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-16 03:09:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-02-16 03:09:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 177 states have internal predecessors, (191), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-16 03:09:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2023-02-16 03:09:30,691 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 29 [2023-02-16 03:09:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:30,691 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2023-02-16 03:09:30,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:09:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2023-02-16 03:09:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:09:30,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:30,692 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:30,707 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-16 03:09:30,901 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-16 03:09:30,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 924079462, now seen corresponding path program 1 times [2023-02-16 03:09:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:30,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352571601] [2023-02-16 03:09:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:30,903 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-16 03:09:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:30,904 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-16 03:09:30,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 03:09:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:31,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 03:09:31,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:31,141 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-16 03:09:31,168 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:09:31,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:09:31,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:09:31,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,369 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,394 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,483 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,511 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:09:31,545 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:31,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-16 03:09:31,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-16 03:09:31,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-16 03:09:31,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-02-16 03:09:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-16 03:09:31,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:09:36,513 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-16 03:09:36,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:09:36,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-16 03:09:36,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-16 03:09:36,544 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 11 treesize of output 7 [2023-02-16 03:09:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-16 03:09:43,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:09:43,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352571601] [2023-02-16 03:09:43,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352571601] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:09:43,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:09:43,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-16 03:09:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636104167] [2023-02-16 03:09:43,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:09:43,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:09:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:09:43,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:09:43,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=320, Unknown=3, NotChecked=36, Total=420 [2023-02-16 03:09:43,530 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:09:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:09:45,832 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2023-02-16 03:09:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:09:45,833 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-16 03:09:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:09:45,834 INFO L225 Difference]: With dead ends: 219 [2023-02-16 03:09:45,834 INFO L226 Difference]: Without dead ends: 219 [2023-02-16 03:09:45,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=95, Invalid=458, Unknown=3, NotChecked=44, Total=600 [2023-02-16 03:09:45,835 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 25 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:09:45,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2001 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 829 Invalid, 0 Unknown, 76 Unchecked, 2.0s Time] [2023-02-16 03:09:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-16 03:09:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-02-16 03:09:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 176 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-16 03:09:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2023-02-16 03:09:45,843 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 30 [2023-02-16 03:09:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:09:45,843 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2023-02-16 03:09:45,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:09:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2023-02-16 03:09:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:09:45,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:09:45,844 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:09:45,857 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-16 03:09:46,044 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-16 03:09:46,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:09:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:09:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash 924079463, now seen corresponding path program 1 times [2023-02-16 03:09:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:09:46,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061993015] [2023-02-16 03:09:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:09:46,046 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-16 03:09:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:09:46,047 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-16 03:09:46,047 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-16 03:09:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:09:46,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-16 03:09:46,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:09:46,335 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-16 03:09:46,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:09:46,380 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-16 03:09:46,388 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 10 treesize of output 9 [2023-02-16 03:09:46,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:09:46,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:09:46,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:46,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:46,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:09:46,713 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 16 treesize of output 18 [2023-02-16 03:09:46,736 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:46,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:46,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:09:46,755 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 16 treesize of output 18 [2023-02-16 03:09:46,781 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:09:46,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:09:46,796 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 7 treesize of output 3 [2023-02-16 03:09:46,816 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:46,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:46,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:46,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:46,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:09:46,889 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 16 treesize of output 18 [2023-02-16 03:09:46,916 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:46,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:46,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:09:46,937 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 16 treesize of output 18 [2023-02-16 03:09:46,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:09:46,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:09:46,974 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 7 treesize of output 3 [2023-02-16 03:09:46,997 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:46,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:47,052 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:09:47,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:09:47,063 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 7 treesize of output 3 [2023-02-16 03:09:47,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:47,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:09:47,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:09:47,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-16 03:09:47,172 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 22 treesize of output 24 [2023-02-16 03:09:47,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-16 03:09:47,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-16 03:09:47,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-16 03:09:47,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2023-02-16 03:09:47,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-16 03:09:47,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-16 03:09:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-16 03:09:47,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:23,615 WARN L233 SmtUtils]: Spent 35.91s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-16 03:10:31,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:31,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-16 03:10:31,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:31,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-16 03:10:31,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2023-02-16 03:10:31,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2023-02-16 03:10:31,098 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 40 treesize of output 32 [2023-02-16 03:10:31,101 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 66 treesize of output 58 [2023-02-16 03:10:31,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:31,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-02-16 03:10:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-02-16 03:10:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-16 03:10:32,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:32,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061993015] [2023-02-16 03:10:32,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061993015] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:32,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:32,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-16 03:10:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303748780] [2023-02-16 03:10:32,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:10:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:10:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=361, Unknown=4, NotChecked=0, Total=420 [2023-02-16 03:10:32,627 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:10:39,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 03:10:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:44,230 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2023-02-16 03:10:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:10:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-16 03:10:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:44,233 INFO L225 Difference]: With dead ends: 218 [2023-02-16 03:10:44,233 INFO L226 Difference]: Without dead ends: 218 [2023-02-16 03:10:44,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=169, Invalid=883, Unknown=4, NotChecked=0, Total=1056 [2023-02-16 03:10:44,234 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 61 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:44,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2085 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1011 Invalid, 4 Unknown, 0 Unchecked, 6.8s Time] [2023-02-16 03:10:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-16 03:10:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-16 03:10:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 175 states have internal predecessors, (189), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-16 03:10:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2023-02-16 03:10:44,242 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 30 [2023-02-16 03:10:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:44,242 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2023-02-16 03:10:44,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:10:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2023-02-16 03:10:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:10:44,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:44,243 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:44,256 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-16 03:10:44,456 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-16 03:10:44,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:10:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2092985884, now seen corresponding path program 1 times [2023-02-16 03:10:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:44,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875913039] [2023-02-16 03:10:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:44,457 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-16 03:10:44,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:44,459 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-16 03:10:44,462 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-16 03:10:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:44,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 03:10:44,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:44,726 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 10 treesize of output 9 [2023-02-16 03:10:44,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:10:44,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:10:44,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:10:44,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-16 03:10:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-16 03:10:44,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:44,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:44,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875913039] [2023-02-16 03:10:44,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875913039] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:44,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:44,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:10:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384718887] [2023-02-16 03:10:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:44,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:10:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:10:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:44,836 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:10:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:45,466 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2023-02-16 03:10:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:10:45,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-16 03:10:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:45,470 INFO L225 Difference]: With dead ends: 230 [2023-02-16 03:10:45,470 INFO L226 Difference]: Without dead ends: 218 [2023-02-16 03:10:45,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:10:45,471 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 71 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:45,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 753 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:10:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-16 03:10:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2023-02-16 03:10:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.376923076923077) internal successors, (179), 170 states have internal predecessors, (179), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:10:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2023-02-16 03:10:45,481 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2023-02-16 03:10:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:45,481 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2023-02-16 03:10:45,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:10:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2023-02-16 03:10:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 03:10:45,483 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:45,483 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:45,498 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-16 03:10:45,695 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-16 03:10:45,695 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:10:45,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -562772518, now seen corresponding path program 1 times [2023-02-16 03:10:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:45,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542275057] [2023-02-16 03:10:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:45,697 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-16 03:10:45,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:45,698 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-16 03:10:45,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 (15)] Waiting until timeout for monitored process [2023-02-16 03:10:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:45,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:10:45,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-16 03:10:46,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-16 03:10:46,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:46,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542275057] [2023-02-16 03:10:46,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542275057] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:46,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:46,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-16 03:10:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753072233] [2023-02-16 03:10:46,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:46,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:10:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:46,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:10:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:10:46,601 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:10:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:48,717 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2023-02-16 03:10:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 03:10:48,718 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2023-02-16 03:10:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:48,720 INFO L225 Difference]: With dead ends: 291 [2023-02-16 03:10:48,720 INFO L226 Difference]: Without dead ends: 279 [2023-02-16 03:10:48,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=641, Invalid=1521, Unknown=0, NotChecked=0, Total=2162 [2023-02-16 03:10:48,721 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 216 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:48,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2181 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-16 03:10:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-16 03:10:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 220. [2023-02-16 03:10:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 177 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:10:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2023-02-16 03:10:48,730 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 56 [2023-02-16 03:10:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:48,731 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2023-02-16 03:10:48,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:10:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2023-02-16 03:10:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 03:10:48,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:48,732 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:48,751 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-16 03:10:48,952 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-16 03:10:48,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:10:48,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093162, now seen corresponding path program 2 times [2023-02-16 03:10:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:48,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54645450] [2023-02-16 03:10:48,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:10:48,954 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-16 03:10:48,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:48,956 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-16 03:10:48,958 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-16 03:10:49,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 03:10:49,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:10:49,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:10:49,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-02-16 03:10:49,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:49,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:49,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54645450] [2023-02-16 03:10:49,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54645450] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:49,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:49,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:10:49,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775717271] [2023-02-16 03:10:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:49,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:49,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:49,200 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:10:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:49,796 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2023-02-16 03:10:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:10:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-02-16 03:10:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:49,798 INFO L225 Difference]: With dead ends: 218 [2023-02-16 03:10:49,798 INFO L226 Difference]: Without dead ends: 218 [2023-02-16 03:10:49,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:10:49,798 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:49,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 03:10:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-16 03:10:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-16 03:10:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 175 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:10:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2023-02-16 03:10:49,804 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 63 [2023-02-16 03:10:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2023-02-16 03:10:49,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:10:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2023-02-16 03:10:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 03:10:49,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:49,805 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:49,817 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-16 03:10:50,015 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-16 03:10:50,015 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:10:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093161, now seen corresponding path program 1 times [2023-02-16 03:10:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:50,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226298811] [2023-02-16 03:10:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:50,016 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-16 03:10:50,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:50,017 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-16 03:10:50,018 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-16 03:10:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:50,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:10:50,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-02-16 03:10:50,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:50,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:50,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226298811] [2023-02-16 03:10:50,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226298811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:50,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:50,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:10:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744712598] [2023-02-16 03:10:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:50,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:10:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:10:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:10:50,625 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:10:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:51,370 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2023-02-16 03:10:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:10:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-02-16 03:10:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:51,381 INFO L225 Difference]: With dead ends: 216 [2023-02-16 03:10:51,381 INFO L226 Difference]: Without dead ends: 216 [2023-02-16 03:10:51,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:51,384 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:51,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 922 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:10:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-16 03:10:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2023-02-16 03:10:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 173 states have internal predecessors, (182), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:10:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2023-02-16 03:10:51,406 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 63 [2023-02-16 03:10:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:51,406 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2023-02-16 03:10:51,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:10:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2023-02-16 03:10:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-16 03:10:51,407 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:51,407 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:51,424 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-16 03:10:51,621 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-16 03:10:51,621 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:10:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -585378383, now seen corresponding path program 1 times [2023-02-16 03:10:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:51,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596919370] [2023-02-16 03:10:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:51,622 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-16 03:10:51,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:51,623 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-16 03:10:51,625 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-16 03:10:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:52,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-16 03:10:52,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:52,485 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-16 03:10:52,538 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:10:52,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:10:52,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:10:52,702 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,731 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,754 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,784 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,810 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,873 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,898 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,936 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:52,973 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:52,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:53,010 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:53,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-16 03:10:53,049 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:10:53,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-16 03:10:53,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:53,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:53,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:53,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:53,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-16 03:10:53,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-16 03:10:53,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-16 03:10:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-16 03:10:53,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:57,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:10:57,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:10:57,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-16 03:10:57,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:57,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-16 03:10:57,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-16 03:10:57,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 11 treesize of output 7 [2023-02-16 03:10:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 12 not checked. [2023-02-16 03:10:59,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:59,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596919370] [2023-02-16 03:10:59,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596919370] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:10:59,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:59,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-16 03:10:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105406107] [2023-02-16 03:10:59,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:10:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:10:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=257, Unknown=3, NotChecked=102, Total=420 [2023-02-16 03:10:59,522 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:11:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:01,600 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2023-02-16 03:11:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:11:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-16 03:11:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:01,602 INFO L225 Difference]: With dead ends: 220 [2023-02-16 03:11:01,602 INFO L226 Difference]: Without dead ends: 220 [2023-02-16 03:11:01,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=99, Invalid=416, Unknown=3, NotChecked=132, Total=650 [2023-02-16 03:11:01,602 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 20 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:01,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2215 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 774 Invalid, 0 Unknown, 218 Unchecked, 1.7s Time] [2023-02-16 03:11:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-16 03:11:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2023-02-16 03:11:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 172 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:11:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2023-02-16 03:11:01,608 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 64 [2023-02-16 03:11:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:01,608 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2023-02-16 03:11:01,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:11:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2023-02-16 03:11:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-16 03:11:01,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:01,609 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:11:01,629 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-16 03:11:01,825 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-16 03:11:01,825 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:11:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash -585378382, now seen corresponding path program 1 times [2023-02-16 03:11:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:01,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530344190] [2023-02-16 03:11:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:01,826 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-16 03:11:01,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:01,827 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-16 03:11:01,829 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-16 03:11:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:02,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-16 03:11:02,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:02,511 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-16 03:11:02,544 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:11:02,544 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-16 03:11:02,552 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 10 treesize of output 9 [2023-02-16 03:11:02,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:11:02,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:11:02,763 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:02,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:02,772 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 7 treesize of output 3 [2023-02-16 03:11:02,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:02,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:02,845 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:02,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:02,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:02,872 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 16 treesize of output 18 [2023-02-16 03:11:02,892 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:02,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:02,900 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 7 treesize of output 3 [2023-02-16 03:11:02,922 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:02,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:02,973 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:02,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:02,977 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 7 treesize of output 3 [2023-02-16 03:11:03,002 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,067 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,088 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 16 treesize of output 18 [2023-02-16 03:11:03,120 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:03,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:03,125 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 7 treesize of output 3 [2023-02-16 03:11:03,154 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,220 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:03,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:03,225 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 7 treesize of output 3 [2023-02-16 03:11:03,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,308 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,328 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 16 treesize of output 18 [2023-02-16 03:11:03,364 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:03,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:03,372 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 7 treesize of output 3 [2023-02-16 03:11:03,396 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,455 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:03,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:03,461 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 7 treesize of output 3 [2023-02-16 03:11:03,482 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,546 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:11:03,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 03:11:03,556 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 7 treesize of output 3 [2023-02-16 03:11:03,578 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-16 03:11:03,635 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:11:03,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-16 03:11:03,647 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 22 treesize of output 24 [2023-02-16 03:11:03,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-16 03:11:03,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:03,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-16 03:11:03,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2023-02-16 03:11:03,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-16 03:11:03,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:11:03,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:11:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-16 03:11:03,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:48,418 WARN L233 SmtUtils]: Spent 44.27s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-16 03:11:56,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:56,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-02-16 03:11:56,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-02-16 03:11:56,990 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 15 treesize of output 7 [2023-02-16 03:11:57,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:57,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-16 03:11:57,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:57,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-16 03:11:57,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:11:57,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-16 03:11:57,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:11:57,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-16 03:11:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-16 03:11:57,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530344190] [2023-02-16 03:11:57,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530344190] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:11:57,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:11:57,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-16 03:11:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141083087] [2023-02-16 03:11:57,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:11:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:11:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:57,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:11:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=360, Unknown=5, NotChecked=0, Total=420 [2023-02-16 03:11:57,384 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:12:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:07,619 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2023-02-16 03:12:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:12:07,620 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-16 03:12:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:07,622 INFO L225 Difference]: With dead ends: 219 [2023-02-16 03:12:07,622 INFO L226 Difference]: Without dead ends: 219 [2023-02-16 03:12:07,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=168, Invalid=882, Unknown=6, NotChecked=0, Total=1056 [2023-02-16 03:12:07,623 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 52 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:07,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 2299 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1057 Invalid, 3 Unknown, 0 Unchecked, 5.8s Time] [2023-02-16 03:12:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-16 03:12:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2023-02-16 03:12:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.313868613138686) internal successors, (180), 171 states have internal predecessors, (180), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-16 03:12:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2023-02-16 03:12:07,629 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 64 [2023-02-16 03:12:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:07,629 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2023-02-16 03:12:07,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:12:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2023-02-16 03:12:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-16 03:12:07,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:07,631 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:07,656 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-16 03:12:07,845 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-16 03:12:07,845 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:12:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741073, now seen corresponding path program 1 times [2023-02-16 03:12:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:07,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30280509] [2023-02-16 03:12:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:07,847 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-16 03:12:07,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:07,848 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-16 03:12:07,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-16 03:12:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:08,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 03:12:08,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:08,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-16 03:12:08,483 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649))) is different from true [2023-02-16 03:12:08,490 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~malloc33#1.base| (_ bv1 1)))) is different from true [2023-02-16 03:12:08,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:12:08,502 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32))) (_ bv1 1)))) is different from true [2023-02-16 03:12:08,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 03:12:08,513 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~mem34#1.base| (_ bv1 1)))) is different from true [2023-02-16 03:12:08,517 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ bv1 1)))) is different from true [2023-02-16 03:12:08,608 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:12:08,628 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-16 03:12:08,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2023-02-16 03:12:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 1 not checked. [2023-02-16 03:12:08,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-02-16 03:12:09,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:09,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30280509] [2023-02-16 03:12:09,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30280509] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:12:09,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:12:09,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 19 [2023-02-16 03:12:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479464293] [2023-02-16 03:12:09,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:12:09,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:12:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:09,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:12:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=179, Unknown=5, NotChecked=150, Total=380 [2023-02-16 03:12:09,194 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:12:13,639 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, 1] [2023-02-16 03:12:15,641 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, 1] [2023-02-16 03:12:17,646 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, 1] [2023-02-16 03:12:19,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, 1] [2023-02-16 03:12:21,652 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, 1] [2023-02-16 03:12:23,657 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, 1] [2023-02-16 03:12:25,659 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, 1] [2023-02-16 03:12:27,662 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, 1] [2023-02-16 03:12:29,888 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, 1] [2023-02-16 03:12:32,345 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, 1] [2023-02-16 03:12:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:32,729 INFO L93 Difference]: Finished difference Result 280 states and 335 transitions. [2023-02-16 03:12:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 03:12:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2023-02-16 03:12:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:32,731 INFO L225 Difference]: With dead ends: 280 [2023-02-16 03:12:32,731 INFO L226 Difference]: Without dead ends: 280 [2023-02-16 03:12:32,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=859, Unknown=5, NotChecked=330, Total=1406 [2023-02-16 03:12:32,732 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 382 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 174 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 1337 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:32,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 839 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1273 Invalid, 10 Unknown, 1337 Unchecked, 22.8s Time] [2023-02-16 03:12:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-02-16 03:12:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 239. [2023-02-16 03:12:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 188 states have internal predecessors, (204), 40 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2023-02-16 03:12:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2023-02-16 03:12:32,739 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 71 [2023-02-16 03:12:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:32,740 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2023-02-16 03:12:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:12:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2023-02-16 03:12:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-16 03:12:32,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:32,741 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:32,757 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-16 03:12:32,957 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-16 03:12:32,957 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:12:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741072, now seen corresponding path program 1 times [2023-02-16 03:12:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:32,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344578248] [2023-02-16 03:12:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:32,958 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-16 03:12:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:32,959 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-16 03:12:32,962 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-16 03:12:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:33,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 03:12:33,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:33,659 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-16 03:12:33,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:12:33,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-02-16 03:12:33,917 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2940 (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2940) |c_DUPFFnew_#t~mem34#1.base| (bvadd (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)) (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2023-02-16 03:12:33,927 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2940 (_ BitVec 32)) (|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2940) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (bvadd (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)) (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2023-02-16 03:12:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:34,137 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-16 03:12:34,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 29 [2023-02-16 03:12:34,150 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:34,151 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-16 03:12:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 114 trivial. 126 not checked. [2023-02-16 03:12:34,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:39,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344578248] [2023-02-16 03:12:39,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344578248] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1114005629] [2023-02-16 03:12:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:39,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:12:39,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:12:39,209 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:12:39,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-16 03:12:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:40,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-16 03:12:40,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:40,777 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-16 03:12:40,782 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-16 03:12:40,850 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:40,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-16 03:12:40,864 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:40,865 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-16 03:12:41,270 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2940 (_ BitVec 32)) (|DUPFFnew_#t~malloc33#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2940) |DUPFFnew_#t~malloc33#1.base| (bvadd (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)) (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2023-02-16 03:12:41,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:41,461 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-16 03:12:41,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2023-02-16 03:12:41,469 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:41,470 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-16 03:12:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 128 not checked. [2023-02-16 03:12:41,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:42,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1114005629] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:42,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:12:42,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2023-02-16 03:12:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288064222] [2023-02-16 03:12:42,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:12:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:12:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:12:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1026, Unknown=4, NotChecked=198, Total=1332 [2023-02-16 03:12:42,316 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:12:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:51,135 INFO L93 Difference]: Finished difference Result 347 states and 437 transitions. [2023-02-16 03:12:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:12:51,137 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2023-02-16 03:12:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:51,138 INFO L225 Difference]: With dead ends: 347 [2023-02-16 03:12:51,138 INFO L226 Difference]: Without dead ends: 347 [2023-02-16 03:12:51,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=227, Invalid=2037, Unknown=4, NotChecked=282, Total=2550 [2023-02-16 03:12:51,140 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 374 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 4772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 900 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:51,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1537 Invalid, 4772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 3694 Invalid, 0 Unknown, 900 Unchecked, 7.2s Time] [2023-02-16 03:12:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-02-16 03:12:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 309. [2023-02-16 03:12:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 195 states have (on average 1.4) internal successors, (273), 233 states have internal predecessors, (273), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (78), 68 states have call predecessors, (78), 67 states have call successors, (78) [2023-02-16 03:12:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 418 transitions. [2023-02-16 03:12:51,149 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 418 transitions. Word has length 71 [2023-02-16 03:12:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:51,149 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 418 transitions. [2023-02-16 03:12:51,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-16 03:12:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 418 transitions. [2023-02-16 03:12:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-16 03:12:51,150 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:51,150 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:51,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:12:51,372 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-16 03:12:51,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:12:51,560 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:12:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -242190254, now seen corresponding path program 1 times [2023-02-16 03:12:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:51,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276848940] [2023-02-16 03:12:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:51,561 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-16 03:12:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:51,562 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-16 03:12:51,573 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-16 03:12:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:52,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:12:52,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-02-16 03:12:52,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:12:52,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:52,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276848940] [2023-02-16 03:12:52,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276848940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:12:52,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:12:52,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:12:52,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480046581] [2023-02-16 03:12:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:12:52,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:12:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:52,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:12:52,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:12:52,205 INFO L87 Difference]: Start difference. First operand 309 states and 418 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:12:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:53,655 INFO L93 Difference]: Finished difference Result 320 states and 426 transitions. [2023-02-16 03:12:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:12:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2023-02-16 03:12:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:53,658 INFO L225 Difference]: With dead ends: 320 [2023-02-16 03:12:53,658 INFO L226 Difference]: Without dead ends: 320 [2023-02-16 03:12:53,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:12:53,659 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:53,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 749 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-16 03:12:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-02-16 03:12:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 314. [2023-02-16 03:12:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 237 states have internal predecessors, (278), 67 states have call successors, (67), 14 states have call predecessors, (67), 16 states have return successors, (78), 68 states have call predecessors, (78), 67 states have call successors, (78) [2023-02-16 03:12:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 423 transitions. [2023-02-16 03:12:53,668 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 423 transitions. Word has length 77 [2023-02-16 03:12:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:53,668 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 423 transitions. [2023-02-16 03:12:53,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:12:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2023-02-16 03:12:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-16 03:12:53,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:53,669 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:53,683 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-16 03:12:53,881 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-16 03:12:53,881 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:12:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -242190253, now seen corresponding path program 1 times [2023-02-16 03:12:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:53,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053148255] [2023-02-16 03:12:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:53,882 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-16 03:12:53,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:53,884 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-16 03:12:53,885 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-16 03:12:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:54,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:12:54,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-02-16 03:12:54,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:12:54,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:54,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053148255] [2023-02-16 03:12:54,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053148255] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:12:54,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:12:54,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:12:54,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928784723] [2023-02-16 03:12:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:12:54,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:12:54,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:54,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:12:54,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:12:54,653 INFO L87 Difference]: Start difference. First operand 314 states and 423 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:12:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:56,987 INFO L93 Difference]: Finished difference Result 321 states and 426 transitions. [2023-02-16 03:12:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:12:56,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2023-02-16 03:12:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:56,990 INFO L225 Difference]: With dead ends: 321 [2023-02-16 03:12:56,990 INFO L226 Difference]: Without dead ends: 321 [2023-02-16 03:12:56,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:12:56,990 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 224 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:56,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 920 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-16 03:12:56,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-16 03:12:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2023-02-16 03:12:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 237 states have internal predecessors, (277), 67 states have call successors, (67), 14 states have call predecessors, (67), 16 states have return successors, (78), 68 states have call predecessors, (78), 67 states have call successors, (78) [2023-02-16 03:12:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 422 transitions. [2023-02-16 03:12:57,007 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 422 transitions. Word has length 77 [2023-02-16 03:12:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:57,008 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 422 transitions. [2023-02-16 03:12:57,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:12:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 422 transitions. [2023-02-16 03:12:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-16 03:12:57,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:57,009 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:12:57,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-16 03:12:57,224 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-16 03:12:57,224 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:12:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953710, now seen corresponding path program 1 times [2023-02-16 03:12:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:57,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292840720] [2023-02-16 03:12:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:12:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:57,226 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-16 03:12:57,227 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-16 03:12:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:57,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:12:57,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-02-16 03:12:58,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-02-16 03:12:58,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:58,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292840720] [2023-02-16 03:12:58,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292840720] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:12:58,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:12:58,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2023-02-16 03:12:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649621815] [2023-02-16 03:12:58,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:12:58,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 03:12:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 03:12:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:12:58,079 INFO L87 Difference]: Start difference. First operand 314 states and 422 transitions. Second operand has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-16 03:13:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:00,192 INFO L93 Difference]: Finished difference Result 369 states and 494 transitions. [2023-02-16 03:13:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:13:00,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2023-02-16 03:13:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:00,195 INFO L225 Difference]: With dead ends: 369 [2023-02-16 03:13:00,195 INFO L226 Difference]: Without dead ends: 369 [2023-02-16 03:13:00,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:13:00,196 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 263 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:00,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1015 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-16 03:13:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-02-16 03:13:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 352. [2023-02-16 03:13:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 224 states have (on average 1.3839285714285714) internal successors, (310), 265 states have internal predecessors, (310), 74 states have call successors, (74), 17 states have call predecessors, (74), 22 states have return successors, (92), 75 states have call predecessors, (92), 74 states have call successors, (92) [2023-02-16 03:13:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 476 transitions. [2023-02-16 03:13:00,206 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 476 transitions. Word has length 86 [2023-02-16 03:13:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:00,206 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 476 transitions. [2023-02-16 03:13:00,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-16 03:13:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 476 transitions. [2023-02-16 03:13:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-16 03:13:00,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:00,207 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:00,224 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-16 03:13:00,423 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-16 03:13:00,423 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:13:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:00,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953709, now seen corresponding path program 1 times [2023-02-16 03:13:00,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:00,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011496492] [2023-02-16 03:13:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:00,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:13:00,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:00,426 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-16 03:13:00,426 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-16 03:13:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:00,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 03:13:00,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-16 03:13:01,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:02,292 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 20 [2023-02-16 03:13:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-16 03:13:02,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011496492] [2023-02-16 03:13:02,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011496492] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:13:02,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:02,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2023-02-16 03:13:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324379448] [2023-02-16 03:13:02,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:13:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:13:02,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2023-02-16 03:13:02,412 INFO L87 Difference]: Start difference. First operand 352 states and 476 transitions. Second operand has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 03:13:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:08,548 INFO L93 Difference]: Finished difference Result 374 states and 497 transitions. [2023-02-16 03:13:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:13:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2023-02-16 03:13:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:08,551 INFO L225 Difference]: With dead ends: 374 [2023-02-16 03:13:08,551 INFO L226 Difference]: Without dead ends: 374 [2023-02-16 03:13:08,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2023-02-16 03:13:08,551 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 313 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:08,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1998 Invalid, 2675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-02-16 03:13:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-16 03:13:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 357. [2023-02-16 03:13:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 228 states have (on average 1.368421052631579) internal successors, (312), 269 states have internal predecessors, (312), 74 states have call successors, (74), 18 states have call predecessors, (74), 23 states have return successors, (92), 75 states have call predecessors, (92), 74 states have call successors, (92) [2023-02-16 03:13:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 478 transitions. [2023-02-16 03:13:08,561 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 478 transitions. Word has length 86 [2023-02-16 03:13:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:08,562 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 478 transitions. [2023-02-16 03:13:08,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 03:13:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 478 transitions. [2023-02-16 03:13:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-16 03:13:08,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:08,563 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:08,582 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-16 03:13:08,780 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-16 03:13:08,780 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:13:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 194820021, now seen corresponding path program 2 times [2023-02-16 03:13:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:08,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179235002] [2023-02-16 03:13:08,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:13:08,781 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-16 03:13:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:08,783 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-16 03:13:08,787 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-16 03:13:09,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:13:09,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:09,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:13:09,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-02-16 03:13:09,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:09,634 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:13:09,634 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 16 treesize of output 15 [2023-02-16 03:13:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-02-16 03:13:09,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:09,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179235002] [2023-02-16 03:13:09,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179235002] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:13:09,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2023-02-16 03:13:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795103750] [2023-02-16 03:13:09,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:13:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:13:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:13:09,648 INFO L87 Difference]: Start difference. First operand 357 states and 478 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 03:13:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:10,834 INFO L93 Difference]: Finished difference Result 372 states and 491 transitions. [2023-02-16 03:13:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:13:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2023-02-16 03:13:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:10,836 INFO L225 Difference]: With dead ends: 372 [2023-02-16 03:13:10,837 INFO L226 Difference]: Without dead ends: 372 [2023-02-16 03:13:10,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:13:10,837 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 228 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:10,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 673 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-16 03:13:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-02-16 03:13:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 358. [2023-02-16 03:13:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.3652173913043477) internal successors, (314), 269 states have internal predecessors, (314), 74 states have call successors, (74), 19 states have call predecessors, (74), 23 states have return successors, (92), 75 states have call predecessors, (92), 74 states have call successors, (92) [2023-02-16 03:13:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 480 transitions. [2023-02-16 03:13:10,847 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 480 transitions. Word has length 92 [2023-02-16 03:13:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:10,848 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 480 transitions. [2023-02-16 03:13:10,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-16 03:13:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 480 transitions. [2023-02-16 03:13:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-16 03:13:10,849 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:10,849 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:10,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-16 03:13:11,066 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-16 03:13:11,066 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:13:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash 194820022, now seen corresponding path program 2 times [2023-02-16 03:13:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:11,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778635556] [2023-02-16 03:13:11,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:13:11,067 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-16 03:13:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:11,068 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-16 03:13:11,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 (28)] Waiting until timeout for monitored process [2023-02-16 03:13:11,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:13:11,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:11,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:13:11,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 143 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-16 03:13:12,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:12,461 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 20 [2023-02-16 03:13:12,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:12,630 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 16 treesize of output 20 [2023-02-16 03:13:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 143 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-02-16 03:13:13,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:13,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778635556] [2023-02-16 03:13:13,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778635556] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:13:13,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:13,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-02-16 03:13:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072659554] [2023-02-16 03:13:13,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:13,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-16 03:13:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-16 03:13:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2023-02-16 03:13:13,197 INFO L87 Difference]: Start difference. First operand 358 states and 480 transitions. Second operand has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-16 03:13:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:23,466 INFO L93 Difference]: Finished difference Result 465 states and 610 transitions. [2023-02-16 03:13:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 03:13:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 92 [2023-02-16 03:13:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:23,470 INFO L225 Difference]: With dead ends: 465 [2023-02-16 03:13:23,470 INFO L226 Difference]: Without dead ends: 465 [2023-02-16 03:13:23,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=264, Invalid=2088, Unknown=0, NotChecked=0, Total=2352 [2023-02-16 03:13:23,471 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 755 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:23,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 2344 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-02-16 03:13:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-02-16 03:13:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 418. [2023-02-16 03:13:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 305 states have internal predecessors, (375), 99 states have call successors, (99), 20 states have call predecessors, (99), 23 states have return successors, (115), 101 states have call predecessors, (115), 99 states have call successors, (115) [2023-02-16 03:13:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 589 transitions. [2023-02-16 03:13:23,483 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 589 transitions. Word has length 92 [2023-02-16 03:13:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:23,483 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 589 transitions. [2023-02-16 03:13:23,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-16 03:13:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 589 transitions. [2023-02-16 03:13:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-16 03:13:23,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:23,485 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:23,506 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 (28)] Ended with exit code 0 [2023-02-16 03:13:23,702 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-16 03:13:23,702 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:13:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -947573994, now seen corresponding path program 1 times [2023-02-16 03:13:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:23,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618263901] [2023-02-16 03:13:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:23,703 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-16 03:13:23,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:23,704 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-16 03:13:23,705 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-16 03:13:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:24,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 03:13:24,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-02-16 03:13:24,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:13:24,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618263901] [2023-02-16 03:13:24,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618263901] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:13:24,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:13:24,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:13:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336849707] [2023-02-16 03:13:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:13:24,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:13:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:13:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:13:24,297 INFO L87 Difference]: Start difference. First operand 418 states and 589 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:13:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:24,307 INFO L93 Difference]: Finished difference Result 421 states and 589 transitions. [2023-02-16 03:13:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:13:24,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2023-02-16 03:13:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:24,309 INFO L225 Difference]: With dead ends: 421 [2023-02-16 03:13:24,309 INFO L226 Difference]: Without dead ends: 418 [2023-02-16 03:13:24,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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-16 03:13:24,310 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:24,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:13:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-16 03:13:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2023-02-16 03:13:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 265 states have (on average 1.4037735849056603) internal successors, (372), 305 states have internal predecessors, (372), 99 states have call successors, (99), 20 states have call predecessors, (99), 23 states have return successors, (115), 101 states have call predecessors, (115), 99 states have call successors, (115) [2023-02-16 03:13:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 586 transitions. [2023-02-16 03:13:24,321 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 586 transitions. Word has length 92 [2023-02-16 03:13:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:24,321 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 586 transitions. [2023-02-16 03:13:24,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:13:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 586 transitions. [2023-02-16 03:13:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-16 03:13:24,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:24,322 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-02-16 03:13:24,340 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-16 03:13:24,537 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-16 03:13:24,538 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:13:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883697, now seen corresponding path program 3 times [2023-02-16 03:13:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:24,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047706797] [2023-02-16 03:13:24,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 03:13:24,539 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-16 03:13:24,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:24,540 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-16 03:13:24,540 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-16 03:13:25,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 03:13:25,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:25,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:13:25,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2023-02-16 03:13:25,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:25,677 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:13:25,677 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 16 treesize of output 15 [2023-02-16 03:13:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2023-02-16 03:13:25,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047706797] [2023-02-16 03:13:25,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047706797] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:13:25,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:25,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-16 03:13:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853410024] [2023-02-16 03:13:25,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:25,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:13:25,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:13:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:13:25,694 INFO L87 Difference]: Start difference. First operand 418 states and 586 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:13:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:26,446 INFO L93 Difference]: Finished difference Result 444 states and 612 transitions. [2023-02-16 03:13:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:13:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 101 [2023-02-16 03:13:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:26,448 INFO L225 Difference]: With dead ends: 444 [2023-02-16 03:13:26,448 INFO L226 Difference]: Without dead ends: 444 [2023-02-16 03:13:26,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:13:26,449 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 79 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:26,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 976 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 03:13:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-02-16 03:13:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 420. [2023-02-16 03:13:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 267 states have (on average 1.404494382022472) internal successors, (375), 306 states have internal predecessors, (375), 99 states have call successors, (99), 21 states have call predecessors, (99), 23 states have return successors, (115), 101 states have call predecessors, (115), 99 states have call successors, (115) [2023-02-16 03:13:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2023-02-16 03:13:26,460 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 101 [2023-02-16 03:13:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:26,460 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2023-02-16 03:13:26,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-16 03:13:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2023-02-16 03:13:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-16 03:13:26,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:26,462 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-02-16 03:13:26,480 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 (30)] Ended with exit code 0 [2023-02-16 03:13:26,677 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-16 03:13:26,678 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-16 03:13:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883696, now seen corresponding path program 3 times [2023-02-16 03:13:26,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:26,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119808861] [2023-02-16 03:13:26,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 03:13:26,679 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-16 03:13:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:26,682 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-16 03:13:26,685 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-16 03:13:27,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 03:13:27,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:13:27,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:13:27,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-02-16 03:13:27,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:28,226 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 20 [2023-02-16 03:13:28,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:28,379 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 16 treesize of output 20 [2023-02-16 03:13:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-02-16 03:13:29,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:29,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119808861] [2023-02-16 03:13:29,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119808861] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:13:29,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:29,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-02-16 03:13:29,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32973065] [2023-02-16 03:13:29,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:29,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-16 03:13:29,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-16 03:13:29,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2023-02-16 03:13:29,217 INFO L87 Difference]: Start difference. First operand 420 states and 589 transitions. Second operand has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12)