./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:24:13,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:24:13,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:24:13,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:24:13,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:24:13,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:24:13,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:24:13,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:24:13,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:24:13,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:24:13,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:24:13,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:24:13,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:24:13,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:24:13,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:24:13,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:24:13,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:24:13,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:24:13,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:24:13,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:24:13,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:24:13,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:24:13,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:24:13,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:24:13,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:24:13,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:24:13,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:24:13,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:24:13,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:24:13,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:24:13,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:24:13,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:24:13,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:24:13,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:24:13,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:24:13,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:24:13,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:24:13,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:24:13,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:24:13,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:24:13,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:24:13,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:24:13,602 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:24:13,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:24:13,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:24:13,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:24:13,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:24:13,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:24:13,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:24:13,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:24:13,606 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:24:13,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:24:13,607 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:24:13,607 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:24:13,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:24:13,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:24:13,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:24:13,608 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:24:13,608 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:24:13,608 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:24:13,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:24:13,609 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:24:13,609 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:24:13,609 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:24:13,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:24:13,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:24:13,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:24:13,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:13,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:24:13,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:24:13,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:24:13,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:24:13,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:24:13,612 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:24:13,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:24:13,612 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:24:13,612 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2023-02-17 08:24:13,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:24:13,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:24:13,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:24:13,894 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:24:13,895 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:24:13,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-17 08:24:15,070 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:24:15,306 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:24:15,307 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-17 08:24:15,318 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20af6489b/fa94bc237a724f139816f96e195957cc/FLAG9fbdf9b9e [2023-02-17 08:24:15,331 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20af6489b/fa94bc237a724f139816f96e195957cc [2023-02-17 08:24:15,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:24:15,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:24:15,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:15,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:24:15,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:24:15,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:15" (1/1) ... [2023-02-17 08:24:15,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecdcf3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:15, skipping insertion in model container [2023-02-17 08:24:15,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:15" (1/1) ... [2023-02-17 08:24:15,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:24:15,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:15,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:15,659 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 08:24:15,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54353f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:15, skipping insertion in model container [2023-02-17 08:24:15,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:15,661 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:24:15,663 INFO L158 Benchmark]: Toolchain (without parser) took 327.92ms. Allocated memory is still 111.1MB. Free memory was 66.5MB in the beginning and 54.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 08:24:15,664 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:24:15,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.91ms. Allocated memory is still 111.1MB. Free memory was 66.3MB in the beginning and 54.6MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 08:24:15,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.91ms. Allocated memory is still 111.1MB. Free memory was 66.3MB in the beginning and 54.6MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:24:17,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:24:17,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:24:17,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:24:17,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:24:17,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:24:17,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:24:17,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:24:17,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:24:17,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:24:17,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:24:17,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:24:17,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:24:17,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:24:17,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:24:17,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:24:17,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:24:17,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:24:17,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:24:17,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:24:17,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:24:17,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:24:17,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:24:17,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:24:17,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:24:17,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:24:17,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:24:17,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:24:17,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:24:17,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:24:17,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:24:17,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:24:17,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:24:17,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:24:17,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:24:17,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:24:17,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:24:17,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:24:17,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:24:17,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:24:17,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:24:17,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:24:17,749 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:24:17,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:24:17,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:24:17,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:24:17,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:24:17,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:24:17,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:24:17,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:24:17,752 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:24:17,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:24:17,753 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:24:17,753 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:24:17,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:24:17,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:24:17,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:24:17,754 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:24:17,754 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:24:17,754 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:24:17,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:24:17,755 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:24:17,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:24:17,755 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:24:17,755 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:24:17,755 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:24:17,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:24:17,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:24:17,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:24:17,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:17,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:24:17,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:24:17,757 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:24:17,757 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:17,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:24:17,757 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:24:17,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:24:17,758 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:24:17,758 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:24:17,758 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2023-02-17 08:24:18,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:24:18,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:24:18,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:24:18,113 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:24:18,114 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:24:18,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-17 08:24:19,261 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:24:19,532 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:24:19,533 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-17 08:24:19,543 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa04a9a98/c370ae43a0344e5eacfccae1ea6275f1/FLAG6936cca48 [2023-02-17 08:24:19,555 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa04a9a98/c370ae43a0344e5eacfccae1ea6275f1 [2023-02-17 08:24:19,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:24:19,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:24:19,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:19,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:24:19,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:24:19,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:19" (1/1) ... [2023-02-17 08:24:19,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5715b46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:19, skipping insertion in model container [2023-02-17 08:24:19,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:19" (1/1) ... [2023-02-17 08:24:19,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:24:19,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:19,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:19,926 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:24:19,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:19,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:20,008 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:24:20,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:20,096 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:24:20,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20 WrapperNode [2023-02-17 08:24:20,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:20,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:24:20,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:24:20,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:24:20,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,170 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-17 08:24:20,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:24:20,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:24:20,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:24:20,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:24:20,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:24:20,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:24:20,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:24:20,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:24:20,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (1/1) ... [2023-02-17 08:24:20,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:20,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 08:24:20,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 08:24:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 08:24:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:24:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-17 08:24:20,311 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-17 08:24:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:24:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 08:24:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:24:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:24:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:24:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 08:24:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 08:24:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 08:24:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:24:20,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:24:20,468 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:24:20,470 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:24:21,141 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:24:21,148 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:24:21,148 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 08:24:21,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:21 BoogieIcfgContainer [2023-02-17 08:24:21,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:24:21,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:24:21,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:24:21,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:24:21,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:24:19" (1/3) ... [2023-02-17 08:24:21,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153b7cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:24:21, skipping insertion in model container [2023-02-17 08:24:21,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:20" (2/3) ... [2023-02-17 08:24:21,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153b7cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:24:21, skipping insertion in model container [2023-02-17 08:24:21,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:21" (3/3) ... [2023-02-17 08:24:21,158 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2023-02-17 08:24:21,172 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:24:21,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-17 08:24:21,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:24:21,236 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;@2f2ad8f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:24:21,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-17 08:24:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 08:24:21,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:21,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 08:24:21,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2023-02-17 08:24:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:21,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997480405] [2023-02-17 08:24:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:21,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:21,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 08:24:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:21,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 08:24:21,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:21,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:21,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997480405] [2023-02-17 08:24:21,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997480405] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:21,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:21,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:21,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314335542] [2023-02-17 08:24:21,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:21,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 08:24:21,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 08:24:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 08:24:21,405 INFO L87 Difference]: Start difference. First operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:21,444 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-02-17 08:24:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 08:24:21,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 08:24:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:21,461 INFO L225 Difference]: With dead ends: 189 [2023-02-17 08:24:21,461 INFO L226 Difference]: Without dead ends: 187 [2023-02-17 08:24:21,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 08:24:21,468 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:21,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-17 08:24:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-02-17 08:24:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2023-02-17 08:24:21,532 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2023-02-17 08:24:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:21,532 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2023-02-17 08:24:21,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2023-02-17 08:24:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 08:24:21,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:21,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 08:24:21,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-17 08:24:21,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2023-02-17 08:24:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:21,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870319008] [2023-02-17 08:24:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:21,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:21,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:21,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:21,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 08:24:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:21,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:24:21,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:21,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:21,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:21,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:24:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:21,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:21,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:21,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870319008] [2023-02-17 08:24:21,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870319008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:21,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:21,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:21,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767704239] [2023-02-17 08:24:21,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:21,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:21,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:21,953 INFO L87 Difference]: Start difference. First operand 187 states and 198 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:22,510 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2023-02-17 08:24:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:22,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 08:24:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:22,512 INFO L225 Difference]: With dead ends: 207 [2023-02-17 08:24:22,513 INFO L226 Difference]: Without dead ends: 207 [2023-02-17 08:24:22,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:22,514 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:22,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 287 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:24:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-17 08:24:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-02-17 08:24:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-17 08:24:22,530 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2023-02-17 08:24:22,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:22,530 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-17 08:24:22,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-17 08:24:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 08:24:22,531 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:22,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 08:24:22,543 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-17 08:24:22,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:22,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2023-02-17 08:24:22,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:22,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411007437] [2023-02-17 08:24:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:22,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:22,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:22,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 08:24:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:22,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:24:22,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:22,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:22,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:22,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:24:22,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:22,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:22,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:22,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:22,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411007437] [2023-02-17 08:24:22,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411007437] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:22,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:22,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232720746] [2023-02-17 08:24:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:22,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:22,852 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:23,435 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2023-02-17 08:24:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-17 08:24:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:23,438 INFO L225 Difference]: With dead ends: 197 [2023-02-17 08:24:23,438 INFO L226 Difference]: Without dead ends: 197 [2023-02-17 08:24:23,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:23,439 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:23,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 08:24:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-17 08:24:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-02-17 08:24:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2023-02-17 08:24:23,462 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2023-02-17 08:24:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:23,464 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2023-02-17 08:24:23,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2023-02-17 08:24:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:24:23,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:23,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:24:23,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:23,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:23,674 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2023-02-17 08:24:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:23,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994314948] [2023-02-17 08:24:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:23,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:23,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:23,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 08:24:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:23,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:24:23,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:23,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:23,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:23,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:23,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994314948] [2023-02-17 08:24:23,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994314948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:23,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:23,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511081271] [2023-02-17 08:24:23,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:23,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:23,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:23,744 INFO L87 Difference]: Start difference. First operand 186 states and 199 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:23,993 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2023-02-17 08:24:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 08:24:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:23,995 INFO L225 Difference]: With dead ends: 209 [2023-02-17 08:24:23,995 INFO L226 Difference]: Without dead ends: 209 [2023-02-17 08:24:23,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:23,996 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:23,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 232 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-17 08:24:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2023-02-17 08:24:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2023-02-17 08:24:24,004 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2023-02-17 08:24:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:24,004 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2023-02-17 08:24:24,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2023-02-17 08:24:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:24:24,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:24,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:24:24,021 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-17 08:24:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:24,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2023-02-17 08:24:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337578227] [2023-02-17 08:24:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:24,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:24,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:24,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:24,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 (6)] Waiting until timeout for monitored process [2023-02-17 08:24:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:24,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:24,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:24,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:24,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:24,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:24,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337578227] [2023-02-17 08:24:24,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337578227] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:24,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:24,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419039107] [2023-02-17 08:24:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:24,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:24,289 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:24,585 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-17 08:24:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 08:24:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:24,587 INFO L225 Difference]: With dead ends: 182 [2023-02-17 08:24:24,587 INFO L226 Difference]: Without dead ends: 182 [2023-02-17 08:24:24,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:24,588 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:24,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:24:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-17 08:24:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-17 08:24:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-17 08:24:24,592 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2023-02-17 08:24:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:24,592 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-17 08:24:24,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-17 08:24:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:24:24,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:24,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:24,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:24,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:24,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2023-02-17 08:24:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:24,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745309564] [2023-02-17 08:24:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:24,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:24,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 08:24:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:24,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:24:24,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:24,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:24,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:24,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:24,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 08:24:24,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 08:24:24,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:24:24,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:24:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:24,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:24,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:24,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745309564] [2023-02-17 08:24:24,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745309564] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:24,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:24,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:24:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784516902] [2023-02-17 08:24:24,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:24,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:24,922 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:25,296 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2023-02-17 08:24:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:25,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 08:24:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:25,298 INFO L225 Difference]: With dead ends: 184 [2023-02-17 08:24:25,298 INFO L226 Difference]: Without dead ends: 184 [2023-02-17 08:24:25,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:25,298 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 6 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:25,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 606 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-17 08:24:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2023-02-17 08:24:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2023-02-17 08:24:25,305 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2023-02-17 08:24:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:25,305 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2023-02-17 08:24:25,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2023-02-17 08:24:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:24:25,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:25,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:25,314 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 (7)] Ended with exit code 0 [2023-02-17 08:24:25,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:25,514 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2023-02-17 08:24:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:25,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158382497] [2023-02-17 08:24:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:25,517 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:25,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 08:24:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:25,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:24:25,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:25,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-17 08:24:25,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:25,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:25,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158382497] [2023-02-17 08:24:25,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158382497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:25,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:25,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578359270] [2023-02-17 08:24:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:25,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:25,583 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:25,607 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2023-02-17 08:24:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:25,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:24:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:25,609 INFO L225 Difference]: With dead ends: 260 [2023-02-17 08:24:25,609 INFO L226 Difference]: Without dead ends: 260 [2023-02-17 08:24:25,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:25,610 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 81 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:25,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 548 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-17 08:24:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2023-02-17 08:24:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2023-02-17 08:24:25,616 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2023-02-17 08:24:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:25,616 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2023-02-17 08:24:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2023-02-17 08:24:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:24:25,617 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:25,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:25,631 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-17 08:24:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:25,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2023-02-17 08:24:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645855102] [2023-02-17 08:24:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:25,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:25,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:25,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 08:24:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:25,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 08:24:25,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:25,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:25,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:25,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:25,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:25,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645855102] [2023-02-17 08:24:25,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645855102] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:25,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:25,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384512869] [2023-02-17 08:24:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:25,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:25,914 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:26,196 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2023-02-17 08:24:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:24:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:26,198 INFO L225 Difference]: With dead ends: 227 [2023-02-17 08:24:26,198 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 08:24:26,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:26,199 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:26,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:24:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 08:24:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2023-02-17 08:24:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2023-02-17 08:24:26,204 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2023-02-17 08:24:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:26,204 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2023-02-17 08:24:26,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2023-02-17 08:24:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:24:26,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:26,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:26,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:26,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:26,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2023-02-17 08:24:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:26,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669174953] [2023-02-17 08:24:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:26,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:26,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:26,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 08:24:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:26,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:24:26,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:26,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:26,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-17 08:24:26,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:24:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:26,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:26,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:26,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669174953] [2023-02-17 08:24:26,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669174953] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:26,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:26,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481393141] [2023-02-17 08:24:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:26,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:26,516 INFO L87 Difference]: Start difference. First operand 218 states and 265 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:26,881 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2023-02-17 08:24:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:26,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:24:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:26,883 INFO L225 Difference]: With dead ends: 239 [2023-02-17 08:24:26,883 INFO L226 Difference]: Without dead ends: 239 [2023-02-17 08:24:26,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:26,884 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:26,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 212 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-17 08:24:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2023-02-17 08:24:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2023-02-17 08:24:26,890 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2023-02-17 08:24:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:26,891 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2023-02-17 08:24:26,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2023-02-17 08:24:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:24:26,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:26,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:26,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:27,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:27,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2023-02-17 08:24:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:27,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518722155] [2023-02-17 08:24:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:27,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:27,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:27,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:27,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 08:24:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:27,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:24:27,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:27,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:27,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:27,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:27,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-02-17 08:24:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:27,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:27,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:27,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518722155] [2023-02-17 08:24:27,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518722155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:27,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:27,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334966358] [2023-02-17 08:24:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:27,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:24:27,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:24:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:27,202 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:27,717 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2023-02-17 08:24:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:24:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 08:24:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:27,720 INFO L225 Difference]: With dead ends: 270 [2023-02-17 08:24:27,720 INFO L226 Difference]: Without dead ends: 270 [2023-02-17 08:24:27,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:24:27,721 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:27,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 408 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:24:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-17 08:24:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-02-17 08:24:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2023-02-17 08:24:27,729 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2023-02-17 08:24:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:27,729 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2023-02-17 08:24:27,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2023-02-17 08:24:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:24:27,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:27,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:27,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:27,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:27,940 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2023-02-17 08:24:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:27,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297228036] [2023-02-17 08:24:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:27,943 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:27,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 08:24:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:28,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:24:28,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:28,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:28,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:28,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:28,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:28,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2023-02-17 08:24:28,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-17 08:24:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:28,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:28,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:28,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297228036] [2023-02-17 08:24:28,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297228036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:28,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:28,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713802502] [2023-02-17 08:24:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:28,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:28,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:28,082 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:28,680 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2023-02-17 08:24:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:24:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-17 08:24:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:28,682 INFO L225 Difference]: With dead ends: 227 [2023-02-17 08:24:28,682 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 08:24:28,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:28,682 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:28,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 421 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 08:24:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 08:24:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2023-02-17 08:24:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2023-02-17 08:24:28,688 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2023-02-17 08:24:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:28,688 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2023-02-17 08:24:28,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2023-02-17 08:24:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:24:28,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:28,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:28,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:28,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:28,889 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:28,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2023-02-17 08:24:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:28,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154762439] [2023-02-17 08:24:28,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:28,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:28,892 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:28,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 08:24:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:29,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 08:24:29,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:29,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:29,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2023-02-17 08:24:29,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:29,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:29,070 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 63 [2023-02-17 08:24:29,077 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 59 treesize of output 35 [2023-02-17 08:24:29,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-02-17 08:24:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:24:29,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:31,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_178) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2023-02-17 08:24:31,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:31,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-02-17 08:24:31,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-02-17 08:24:31,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-17 08:24:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:24:31,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:31,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154762439] [2023-02-17 08:24:31,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154762439] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:31,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:31,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2023-02-17 08:24:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913611213] [2023-02-17 08:24:31,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:31,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:24:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:24:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=50, Unknown=3, NotChecked=14, Total=90 [2023-02-17 08:24:31,218 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:31,979 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2023-02-17 08:24:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 08:24:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:31,981 INFO L225 Difference]: With dead ends: 232 [2023-02-17 08:24:31,981 INFO L226 Difference]: Without dead ends: 232 [2023-02-17 08:24:31,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=29, Invalid=62, Unknown=3, NotChecked=16, Total=110 [2023-02-17 08:24:31,982 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:31,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 560 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 338 Invalid, 0 Unknown, 104 Unchecked, 0.7s Time] [2023-02-17 08:24:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-17 08:24:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-02-17 08:24:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2023-02-17 08:24:31,988 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2023-02-17 08:24:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:31,988 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2023-02-17 08:24:31,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2023-02-17 08:24:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:24:31,989 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:31,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:31,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:32,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:32,200 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2023-02-17 08:24:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:32,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50300674] [2023-02-17 08:24:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:32,202 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:32,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 08:24:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:32,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 08:24:32,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:32,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:32,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:24:32,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:32,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:32,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 73 [2023-02-17 08:24:32,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 08:24:32,426 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 59 treesize of output 35 [2023-02-17 08:24:32,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-02-17 08:24:32,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-17 08:24:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:32,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:32,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_224) c_create_data_~data~0.base) .cse1)))))) is different from false [2023-02-17 08:24:32,702 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_224) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2)))))) is different from false [2023-02-17 08:24:32,739 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (_ bv0 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-17 08:24:32,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-02-17 08:24:32,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2023-02-17 08:24:32,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,766 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 28 treesize of output 29 [2023-02-17 08:24:32,770 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:32,773 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 26 treesize of output 14 [2023-02-17 08:24:32,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,780 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 51 treesize of output 52 [2023-02-17 08:24:32,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:32,788 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 41 treesize of output 42 [2023-02-17 08:24:32,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:32,796 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 39 treesize of output 27 [2023-02-17 08:24:32,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:32,804 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 30 treesize of output 18 [2023-02-17 08:24:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-17 08:24:32,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50300674] [2023-02-17 08:24:32,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50300674] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:32,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:32,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-17 08:24:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542488251] [2023-02-17 08:24:32,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 08:24:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 08:24:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-17 08:24:32,867 INFO L87 Difference]: Start difference. First operand 224 states and 263 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:35,253 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-02-17 08:24:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:24:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 08:24:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:35,255 INFO L225 Difference]: With dead ends: 236 [2023-02-17 08:24:35,255 INFO L226 Difference]: Without dead ends: 236 [2023-02-17 08:24:35,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=179, Unknown=3, NotChecked=90, Total=342 [2023-02-17 08:24:35,256 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:35,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1087 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 671 Invalid, 0 Unknown, 269 Unchecked, 2.2s Time] [2023-02-17 08:24:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-17 08:24:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-02-17 08:24:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2023-02-17 08:24:35,261 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2023-02-17 08:24:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:35,262 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-02-17 08:24:35,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2023-02-17 08:24:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:24:35,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:35,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:35,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:35,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:35,473 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2023-02-17 08:24:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:35,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496121870] [2023-02-17 08:24:35,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:24:35,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:35,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:35,476 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:35,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 08:24:35,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:24:35,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:24:35,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 08:24:35,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:35,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:35,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:35,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:24:35,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:35,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:35,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:35,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 73 [2023-02-17 08:24:35,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 08:24:35,769 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 59 treesize of output 35 [2023-02-17 08:24:35,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:35,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 73 [2023-02-17 08:24:35,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 08:24:35,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-02-17 08:24:35,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-02-17 08:24:35,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-17 08:24:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:35,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:36,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse1 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse0) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse0) .cse1))))) is different from false [2023-02-17 08:24:36,113 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-02-17 08:24:36,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-17 08:24:36,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse2 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) c_create_data_~counter~0))))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse1) v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse1) v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2))))) is different from false [2023-02-17 08:24:36,218 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) c_create_data_~counter~0)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) .cse4 v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse2))))))))) is different from false [2023-02-17 08:24:36,259 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2)) (.cse3 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (bvadd (_ bv1 32) (_ bv0 32)))))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_284))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_283) .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse3)))))) is different from false [2023-02-17 08:24:36,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:36,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 94 [2023-02-17 08:24:36,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:36,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 74 [2023-02-17 08:24:36,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 112 [2023-02-17 08:24:36,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 228 [2023-02-17 08:24:36,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 142 [2023-02-17 08:24:36,316 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 142 treesize of output 134 [2023-02-17 08:24:36,320 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 200 treesize of output 176 [2023-02-17 08:24:36,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:36,341 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 52 treesize of output 53 [2023-02-17 08:24:36,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:36,348 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 42 treesize of output 43 [2023-02-17 08:24:36,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:36,356 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 40 treesize of output 28 [2023-02-17 08:24:36,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:36,365 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 28 treesize of output 16 [2023-02-17 08:24:36,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:36,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 98 [2023-02-17 08:24:36,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:36,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 68 [2023-02-17 08:24:36,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:36,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 72 [2023-02-17 08:24:36,397 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:36,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2023-02-17 08:24:36,403 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 08:24:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-02-17 08:24:36,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:36,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496121870] [2023-02-17 08:24:36,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496121870] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:36,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:36,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-02-17 08:24:36,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293405010] [2023-02-17 08:24:36,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:36,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 08:24:36,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:36,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 08:24:36,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2023-02-17 08:24:36,468 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:38,524 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2023-02-17 08:24:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:24:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-17 08:24:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:38,526 INFO L225 Difference]: With dead ends: 246 [2023-02-17 08:24:38,527 INFO L226 Difference]: Without dead ends: 246 [2023-02-17 08:24:38,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=265, Unknown=6, NotChecked=234, Total=600 [2023-02-17 08:24:38,528 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:38,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1256 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 632 Invalid, 0 Unknown, 570 Unchecked, 1.8s Time] [2023-02-17 08:24:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-17 08:24:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2023-02-17 08:24:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2023-02-17 08:24:38,533 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 27 [2023-02-17 08:24:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:38,533 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2023-02-17 08:24:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2023-02-17 08:24:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 08:24:38,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:38,535 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:38,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-17 08:24:38,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:38,746 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 852563911, now seen corresponding path program 3 times [2023-02-17 08:24:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:38,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198979612] [2023-02-17 08:24:38,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:24:38,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:38,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:38,749 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:38,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 08:24:39,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 08:24:39,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:24:39,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 08:24:39,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:39,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:39,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:39,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198979612] [2023-02-17 08:24:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198979612] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:39,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:39,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 08:24:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30178935] [2023-02-17 08:24:39,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:39,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:24:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:24:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:24:39,088 INFO L87 Difference]: Start difference. First operand 244 states and 283 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:39,201 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2023-02-17 08:24:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-17 08:24:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:39,203 INFO L225 Difference]: With dead ends: 241 [2023-02-17 08:24:39,203 INFO L226 Difference]: Without dead ends: 241 [2023-02-17 08:24:39,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:24:39,204 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:39,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1243 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:24:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-17 08:24:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2023-02-17 08:24:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 275 transitions. [2023-02-17 08:24:39,209 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 275 transitions. Word has length 32 [2023-02-17 08:24:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:39,209 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 275 transitions. [2023-02-17 08:24:39,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 275 transitions. [2023-02-17 08:24:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 08:24:39,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:39,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:39,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:39,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:39,422 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2023-02-17 08:24:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:39,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154230107] [2023-02-17 08:24:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:39,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:39,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:39,426 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 08:24:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:39,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:24:39,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:39,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:39,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:39,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:39,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154230107] [2023-02-17 08:24:39,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154230107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:39,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:39,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714458820] [2023-02-17 08:24:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:39,614 INFO L87 Difference]: Start difference. First operand 239 states and 275 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:39,856 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2023-02-17 08:24:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:39,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-17 08:24:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:39,858 INFO L225 Difference]: With dead ends: 241 [2023-02-17 08:24:39,858 INFO L226 Difference]: Without dead ends: 241 [2023-02-17 08:24:39,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:39,859 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:39,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-17 08:24:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2023-02-17 08:24:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2023-02-17 08:24:39,864 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 41 [2023-02-17 08:24:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:39,864 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2023-02-17 08:24:39,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2023-02-17 08:24:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 08:24:39,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:39,869 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:39,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:40,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:40,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2023-02-17 08:24:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:40,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271884756] [2023-02-17 08:24:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:40,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:40,084 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:40,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 08:24:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:40,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:40,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:40,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:40,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:40,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271884756] [2023-02-17 08:24:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271884756] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:40,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:40,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184926009] [2023-02-17 08:24:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:40,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:40,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:40,258 INFO L87 Difference]: Start difference. First operand 235 states and 263 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:40,529 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2023-02-17 08:24:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-17 08:24:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:40,531 INFO L225 Difference]: With dead ends: 237 [2023-02-17 08:24:40,531 INFO L226 Difference]: Without dead ends: 237 [2023-02-17 08:24:40,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:40,531 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:40,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:24:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-17 08:24:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2023-02-17 08:24:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2023-02-17 08:24:40,536 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 41 [2023-02-17 08:24:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:40,536 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2023-02-17 08:24:40,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2023-02-17 08:24:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 08:24:40,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:40,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:40,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:40,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:40,738 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2023-02-17 08:24:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:40,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108266099] [2023-02-17 08:24:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:40,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:40,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:40,740 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:40,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 08:24:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:40,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:24:40,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:40,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:41,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:41,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:24:41,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:41,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 74 [2023-02-17 08:24:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 08:24:41,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:41,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:41,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108266099] [2023-02-17 08:24:41,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108266099] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:41,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:41,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-02-17 08:24:41,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123065680] [2023-02-17 08:24:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:41,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:41,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:41,497 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:41,965 INFO L93 Difference]: Finished difference Result 254 states and 275 transitions. [2023-02-17 08:24:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-02-17 08:24:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:41,967 INFO L225 Difference]: With dead ends: 254 [2023-02-17 08:24:41,967 INFO L226 Difference]: Without dead ends: 254 [2023-02-17 08:24:41,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:41,968 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 97 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:41,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:24:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-17 08:24:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 229. [2023-02-17 08:24:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 224 states have internal predecessors, (245), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:24:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 249 transitions. [2023-02-17 08:24:41,972 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 249 transitions. Word has length 44 [2023-02-17 08:24:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:41,973 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 249 transitions. [2023-02-17 08:24:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 249 transitions. [2023-02-17 08:24:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 08:24:41,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:41,974 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:41,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:42,191 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-17 08:24:42,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2023-02-17 08:24:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:42,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916373366] [2023-02-17 08:24:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:42,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:42,194 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-17 08:24:42,202 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-17 08:24:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:42,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:24:42,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:42,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:42,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 5 [2023-02-17 08:24:42,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:42,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:24:42,557 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_52 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_781 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_781) v_arrayElimCell_52 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:24:42,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:42,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:42,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:24:42,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 08:24:42,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:42,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:42,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916373366] [2023-02-17 08:24:42,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916373366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:42,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [780340922] [2023-02-17 08:24:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:42,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:24:42,723 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:24:42,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-02-17 08:24:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:43,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:24:43,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:43,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:43,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:43,101 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_897 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_897) |create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-17 08:24:43,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:43,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:43,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:24:43,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:43,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:43,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:43,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [780340922] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:43,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:43,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-02-17 08:24:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326845635] [2023-02-17 08:24:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:43,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:43,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2023-02-17 08:24:43,176 INFO L87 Difference]: Start difference. First operand 229 states and 249 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:44,088 INFO L93 Difference]: Finished difference Result 376 states and 409 transitions. [2023-02-17 08:24:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-02-17 08:24:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:44,091 INFO L225 Difference]: With dead ends: 376 [2023-02-17 08:24:44,091 INFO L226 Difference]: Without dead ends: 376 [2023-02-17 08:24:44,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2023-02-17 08:24:44,091 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:44,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 284 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 254 Unchecked, 0.9s Time] [2023-02-17 08:24:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-02-17 08:24:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 244. [2023-02-17 08:24:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 237 states have internal predecessors, (262), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:24:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2023-02-17 08:24:44,099 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 44 [2023-02-17 08:24:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:44,099 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2023-02-17 08:24:44,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2023-02-17 08:24:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:24:44,103 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:44,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:44,117 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-17 08:24:44,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:44,516 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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:44,517 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:44,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1359492876, now seen corresponding path program 1 times [2023-02-17 08:24:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:44,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353161265] [2023-02-17 08:24:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:44,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:44,519 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:44,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-17 08:24:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:44,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:24:44,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:44,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:44,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:44,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:24:44,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-02-17 08:24:44,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:44,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-02-17 08:24:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:44,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:44,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:44,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353161265] [2023-02-17 08:24:44,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353161265] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:44,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:44,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:24:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357978772] [2023-02-17 08:24:44,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:44,888 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:45,199 INFO L93 Difference]: Finished difference Result 286 states and 318 transitions. [2023-02-17 08:24:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:24:45,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-17 08:24:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:45,201 INFO L225 Difference]: With dead ends: 286 [2023-02-17 08:24:45,201 INFO L226 Difference]: Without dead ends: 286 [2023-02-17 08:24:45,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:24:45,202 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 28 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:45,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 696 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:24:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-02-17 08:24:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2023-02-17 08:24:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 247 states have internal predecessors, (273), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:24:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2023-02-17 08:24:45,213 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 46 [2023-02-17 08:24:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:45,214 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2023-02-17 08:24:45,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2023-02-17 08:24:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:24:45,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:45,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:45,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:45,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:45,421 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash 918765396, now seen corresponding path program 1 times [2023-02-17 08:24:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:45,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905189446] [2023-02-17 08:24:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:45,423 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:45,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 08:24:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:45,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:24:45,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:45,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:45,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905189446] [2023-02-17 08:24:45,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905189446] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:45,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:45,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:45,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647092851] [2023-02-17 08:24:45,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:45,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:45,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:45,590 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:45,608 INFO L93 Difference]: Finished difference Result 262 states and 285 transitions. [2023-02-17 08:24:45,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:45,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-17 08:24:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:45,609 INFO L225 Difference]: With dead ends: 262 [2023-02-17 08:24:45,609 INFO L226 Difference]: Without dead ends: 262 [2023-02-17 08:24:45,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:45,610 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:45,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 449 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-17 08:24:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2023-02-17 08:24:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 205 states have (on average 1.351219512195122) internal successors, (277), 253 states have internal predecessors, (277), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:24:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 283 transitions. [2023-02-17 08:24:45,616 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 283 transitions. Word has length 46 [2023-02-17 08:24:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:45,616 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 283 transitions. [2023-02-17 08:24:45,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 283 transitions. [2023-02-17 08:24:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:24:45,617 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:45,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:45,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 (23)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:45,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:45,829 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703003, now seen corresponding path program 1 times [2023-02-17 08:24:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:45,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577981770] [2023-02-17 08:24:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:45,832 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:45,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-17 08:24:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:46,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:24:46,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:46,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:46,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:46,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:24:46,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:46,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 74 [2023-02-17 08:24:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 08:24:46,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:46,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:46,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577981770] [2023-02-17 08:24:46,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577981770] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:46,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:46,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-02-17 08:24:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259596632] [2023-02-17 08:24:46,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:46,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:46,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:46,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:46,711 INFO L87 Difference]: Start difference. First operand 260 states and 283 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:47,146 INFO L93 Difference]: Finished difference Result 284 states and 308 transitions. [2023-02-17 08:24:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:47,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-17 08:24:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:47,147 INFO L225 Difference]: With dead ends: 284 [2023-02-17 08:24:47,147 INFO L226 Difference]: Without dead ends: 284 [2023-02-17 08:24:47,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:47,148 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 95 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:47,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 202 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-17 08:24:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 259. [2023-02-17 08:24:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.3463414634146342) internal successors, (276), 252 states have internal predecessors, (276), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:24:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 282 transitions. [2023-02-17 08:24:47,153 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 282 transitions. Word has length 46 [2023-02-17 08:24:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:47,154 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 282 transitions. [2023-02-17 08:24:47,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 282 transitions. [2023-02-17 08:24:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:24:47,154 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:47,154 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:47,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:47,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:47,367 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703002, now seen corresponding path program 1 times [2023-02-17 08:24:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:47,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138038517] [2023-02-17 08:24:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:47,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:47,369 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:47,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-17 08:24:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:47,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:24:47,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:47,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:47,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:47,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:24:47,770 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1338 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1338) v_arrayElimCell_66 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:24:47,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:47,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:47,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 49 [2023-02-17 08:24:47,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:47,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 08:24:47,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:49,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:49,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138038517] [2023-02-17 08:24:49,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138038517] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:49,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [361697251] [2023-02-17 08:24:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:24:49,941 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:24:49,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-17 08:24:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:24:50,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:50,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:50,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:24:50,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:50,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:50,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:50,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:50,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 38 [2023-02-17 08:24:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:50,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:50,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [361697251] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:50,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:50,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-02-17 08:24:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853672859] [2023-02-17 08:24:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:50,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:24:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:24:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=4, NotChecked=30, Total=306 [2023-02-17 08:24:50,718 INFO L87 Difference]: Start difference. First operand 259 states and 282 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:52,412 INFO L93 Difference]: Finished difference Result 467 states and 508 transitions. [2023-02-17 08:24:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:24:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-17 08:24:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:52,415 INFO L225 Difference]: With dead ends: 467 [2023-02-17 08:24:52,415 INFO L226 Difference]: Without dead ends: 467 [2023-02-17 08:24:52,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=58, Invalid=282, Unknown=6, NotChecked=34, Total=380 [2023-02-17 08:24:52,416 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 268 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 13 mSolverCounterUnsat, 129 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 129 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:52,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 466 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 441 Invalid, 129 Unknown, 0 Unchecked, 1.6s Time] [2023-02-17 08:24:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-02-17 08:24:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 403. [2023-02-17 08:24:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 343 states have (on average 1.3061224489795917) internal successors, (448), 390 states have internal predecessors, (448), 4 states have call successors, (4), 4 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-17 08:24:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 462 transitions. [2023-02-17 08:24:52,427 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 462 transitions. Word has length 46 [2023-02-17 08:24:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:52,427 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 462 transitions. [2023-02-17 08:24:52,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 462 transitions. [2023-02-17 08:24:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:24:52,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:52,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:52,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:52,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:52,834 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875697, now seen corresponding path program 1 times [2023-02-17 08:24:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:52,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182470607] [2023-02-17 08:24:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:52,836 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:52,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 08:24:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:53,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:24:53,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:53,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:53,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:53,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:24:53,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:24:53,156 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_73 (_ BitVec 32)) (v_ArrVal_1563 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1563) v_arrayElimCell_73 (_ bv80 32))))) is different from true [2023-02-17 08:24:53,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:53,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:53,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:24:53,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:53,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 08:24:53,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:53,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182470607] [2023-02-17 08:24:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182470607] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:53,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1735506686] [2023-02-17 08:24:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:53,333 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:24:53,337 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:24:53,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-17 08:24:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:53,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:24:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:53,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:53,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:24:53,858 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1677 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1677) |c_create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:24:53,878 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1677 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1677) |create_data_#t~malloc7.base| (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:24:53,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:24:53,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:53,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:24:53,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:53,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:24:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:53,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:53,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1735506686] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:53,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:53,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-17 08:24:53,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068716393] [2023-02-17 08:24:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:53,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:24:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:53,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:24:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=57, Unknown=3, NotChecked=48, Total=132 [2023-02-17 08:24:53,941 INFO L87 Difference]: Start difference. First operand 403 states and 462 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:54,969 INFO L93 Difference]: Finished difference Result 588 states and 682 transitions. [2023-02-17 08:24:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:24:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-17 08:24:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:54,972 INFO L225 Difference]: With dead ends: 588 [2023-02-17 08:24:54,972 INFO L226 Difference]: Without dead ends: 588 [2023-02-17 08:24:54,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=57, Unknown=3, NotChecked=48, Total=132 [2023-02-17 08:24:54,973 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 140 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:54,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 426 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 511 Unchecked, 1.0s Time] [2023-02-17 08:24:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2023-02-17 08:24:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 418. [2023-02-17 08:24:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 405 states have internal predecessors, (466), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 481 transitions. [2023-02-17 08:24:54,983 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 481 transitions. Word has length 48 [2023-02-17 08:24:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:54,983 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 481 transitions. [2023-02-17 08:24:54,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 481 transitions. [2023-02-17 08:24:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:24:54,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:54,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:54,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-02-17 08:24:55,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-02-17 08:24:55,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:24:55,397 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash 471257990, now seen corresponding path program 1 times [2023-02-17 08:24:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:55,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268762949] [2023-02-17 08:24:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:55,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:55,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:55,399 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-17 08:24:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:55,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:55,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:55,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:55,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:55,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268762949] [2023-02-17 08:24:55,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268762949] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:55,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:55,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888710476] [2023-02-17 08:24:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:55,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:55,597 INFO L87 Difference]: Start difference. First operand 418 states and 481 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:55,848 INFO L93 Difference]: Finished difference Result 417 states and 479 transitions. [2023-02-17 08:24:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-17 08:24:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:55,850 INFO L225 Difference]: With dead ends: 417 [2023-02-17 08:24:55,850 INFO L226 Difference]: Without dead ends: 417 [2023-02-17 08:24:55,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:55,851 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:55,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 215 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-02-17 08:24:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-02-17 08:24:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 357 states have (on average 1.2997198879551821) internal successors, (464), 404 states have internal predecessors, (464), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 479 transitions. [2023-02-17 08:24:55,864 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 479 transitions. Word has length 48 [2023-02-17 08:24:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:55,865 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 479 transitions. [2023-02-17 08:24:55,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 479 transitions. [2023-02-17 08:24:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:24:55,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:55,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:55,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:56,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:56,078 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 471257991, now seen corresponding path program 1 times [2023-02-17 08:24:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:56,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428342554] [2023-02-17 08:24:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:56,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:56,082 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:56,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-17 08:24:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:56,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:24:56,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:56,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:56,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428342554] [2023-02-17 08:24:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428342554] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:56,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213523142] [2023-02-17 08:24:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:24:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:24:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:56,311 INFO L87 Difference]: Start difference. First operand 417 states and 479 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:56,413 INFO L93 Difference]: Finished difference Result 408 states and 467 transitions. [2023-02-17 08:24:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-17 08:24:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:56,415 INFO L225 Difference]: With dead ends: 408 [2023-02-17 08:24:56,415 INFO L226 Difference]: Without dead ends: 408 [2023-02-17 08:24:56,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:56,416 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 203 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:56,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 178 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:24:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-17 08:24:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2023-02-17 08:24:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 357 states have (on average 1.2661064425770308) internal successors, (452), 395 states have internal predecessors, (452), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 467 transitions. [2023-02-17 08:24:56,423 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 467 transitions. Word has length 48 [2023-02-17 08:24:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:56,423 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 467 transitions. [2023-02-17 08:24:56,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 467 transitions. [2023-02-17 08:24:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 08:24:56,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:56,424 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:56,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:56,635 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-17 08:24:56,635 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:56,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095953, now seen corresponding path program 1 times [2023-02-17 08:24:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:56,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308916149] [2023-02-17 08:24:56,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:56,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:56,637 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-17 08:24:56,638 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-17 08:24:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:56,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:24:56,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:56,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:24:56,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 08:24:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:56,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:56,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:56,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308916149] [2023-02-17 08:24:56,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308916149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:56,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:56,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023727913] [2023-02-17 08:24:56,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:56,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:56,858 INFO L87 Difference]: Start difference. First operand 408 states and 467 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:57,255 INFO L93 Difference]: Finished difference Result 429 states and 488 transitions. [2023-02-17 08:24:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:57,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-17 08:24:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:57,258 INFO L225 Difference]: With dead ends: 429 [2023-02-17 08:24:57,258 INFO L226 Difference]: Without dead ends: 429 [2023-02-17 08:24:57,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:57,258 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 194 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:57,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 323 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-02-17 08:24:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 407. [2023-02-17 08:24:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2605042016806722) internal successors, (450), 394 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 465 transitions. [2023-02-17 08:24:57,265 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 465 transitions. Word has length 49 [2023-02-17 08:24:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:57,265 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 465 transitions. [2023-02-17 08:24:57,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 465 transitions. [2023-02-17 08:24:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 08:24:57,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:57,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:57,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:57,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:57,466 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095954, now seen corresponding path program 1 times [2023-02-17 08:24:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:57,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937470772] [2023-02-17 08:24:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:57,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:57,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:57,469 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:57,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-17 08:24:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:57,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:24:57,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:57,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:24:57,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:24:57,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-17 08:24:57,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:24:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:57,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:57,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:57,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937470772] [2023-02-17 08:24:57,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937470772] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:57,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:57,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520273649] [2023-02-17 08:24:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:57,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:57,708 INFO L87 Difference]: Start difference. First operand 407 states and 465 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:58,154 INFO L93 Difference]: Finished difference Result 445 states and 503 transitions. [2023-02-17 08:24:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:58,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-17 08:24:58,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:58,156 INFO L225 Difference]: With dead ends: 445 [2023-02-17 08:24:58,156 INFO L226 Difference]: Without dead ends: 445 [2023-02-17 08:24:58,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:58,157 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 281 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:58,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 305 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-17 08:24:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 406. [2023-02-17 08:24:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 357 states have (on average 1.2549019607843137) internal successors, (448), 393 states have internal predecessors, (448), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 463 transitions. [2023-02-17 08:24:58,163 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 463 transitions. Word has length 49 [2023-02-17 08:24:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:58,164 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 463 transitions. [2023-02-17 08:24:58,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 463 transitions. [2023-02-17 08:24:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 08:24:58,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:58,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:58,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-02-17 08:24:58,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:58,376 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -42553449, now seen corresponding path program 1 times [2023-02-17 08:24:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:58,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591697906] [2023-02-17 08:24:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:58,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:58,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:58,378 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:58,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-17 08:24:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:58,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:24:58,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:58,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:24:58,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 08:24:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:58,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:58,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591697906] [2023-02-17 08:24:58,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591697906] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:58,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:58,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659875027] [2023-02-17 08:24:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:58,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:58,628 INFO L87 Difference]: Start difference. First operand 406 states and 463 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:58,992 INFO L93 Difference]: Finished difference Result 429 states and 486 transitions. [2023-02-17 08:24:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-17 08:24:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:58,994 INFO L225 Difference]: With dead ends: 429 [2023-02-17 08:24:58,994 INFO L226 Difference]: Without dead ends: 429 [2023-02-17 08:24:58,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:58,995 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 177 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:58,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 326 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-02-17 08:24:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 405. [2023-02-17 08:24:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 357 states have (on average 1.2492997198879552) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 461 transitions. [2023-02-17 08:24:59,002 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 461 transitions. Word has length 53 [2023-02-17 08:24:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:59,002 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 461 transitions. [2023-02-17 08:24:59,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 461 transitions. [2023-02-17 08:24:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 08:24:59,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:59,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:59,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-02-17 08:24:59,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:59,215 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:24:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:59,215 INFO L85 PathProgramCache]: Analyzing trace with hash -42553448, now seen corresponding path program 1 times [2023-02-17 08:24:59,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:24:59,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851649704] [2023-02-17 08:24:59,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:24:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:24:59,217 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:24:59,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-17 08:24:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:59,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:24:59,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:59,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:24:59,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 11 treesize of output 7 [2023-02-17 08:24:59,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 19 treesize of output 11 [2023-02-17 08:24:59,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:24:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:24:59,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:59,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:24:59,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851649704] [2023-02-17 08:24:59,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851649704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:59,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:59,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113660967] [2023-02-17 08:24:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:24:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:59,522 INFO L87 Difference]: Start difference. First operand 405 states and 461 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:59,893 INFO L93 Difference]: Finished difference Result 445 states and 501 transitions. [2023-02-17 08:24:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-17 08:24:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:59,895 INFO L225 Difference]: With dead ends: 445 [2023-02-17 08:24:59,895 INFO L226 Difference]: Without dead ends: 445 [2023-02-17 08:24:59,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:59,895 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 264 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:59,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 308 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:24:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-17 08:24:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 404. [2023-02-17 08:24:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 357 states have (on average 1.2436974789915967) internal successors, (444), 391 states have internal predecessors, (444), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (11), 8 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-17 08:24:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 459 transitions. [2023-02-17 08:24:59,905 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 459 transitions. Word has length 53 [2023-02-17 08:24:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:59,905 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 459 transitions. [2023-02-17 08:24:59,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:24:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 459 transitions. [2023-02-17 08:24:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 08:24:59,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:59,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:59,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:00,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:00,109 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting create_dataErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:00,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982670, now seen corresponding path program 1 times [2023-02-17 08:25:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:00,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099869464] [2023-02-17 08:25:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:00,111 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:00,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-17 08:25:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:00,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:25:00,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:00,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:00,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:00,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:25:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:00,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:00,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:00,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099869464] [2023-02-17 08:25:00,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099869464] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:25:00,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:25:00,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-17 08:25:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610068236] [2023-02-17 08:25:00,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:25:00,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:25:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:00,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:25:00,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:25:00,608 INFO L87 Difference]: Start difference. First operand 404 states and 459 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:25:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:00,931 INFO L93 Difference]: Finished difference Result 409 states and 463 transitions. [2023-02-17 08:25:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:25:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-17 08:25:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:00,933 INFO L225 Difference]: With dead ends: 409 [2023-02-17 08:25:00,933 INFO L226 Difference]: Without dead ends: 409 [2023-02-17 08:25:00,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:25:00,933 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:00,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 237 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:25:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-02-17 08:25:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 400. [2023-02-17 08:25:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 353 states have (on average 1.2351274787535411) internal successors, (436), 387 states have internal predecessors, (436), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 452 transitions. [2023-02-17 08:25:00,952 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 452 transitions. Word has length 53 [2023-02-17 08:25:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:00,952 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 452 transitions. [2023-02-17 08:25:00,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:25:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 452 transitions. [2023-02-17 08:25:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 08:25:00,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:00,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:00,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:01,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:01,168 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982671, now seen corresponding path program 1 times [2023-02-17 08:25:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:01,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184850114] [2023-02-17 08:25:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:01,171 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:01,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-17 08:25:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:01,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:25:01,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:01,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:01,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:01,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:25:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:01,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:01,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:01,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184850114] [2023-02-17 08:25:01,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184850114] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:25:01,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:25:01,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-02-17 08:25:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725171374] [2023-02-17 08:25:01,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:25:01,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:25:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:25:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:25:01,734 INFO L87 Difference]: Start difference. First operand 400 states and 452 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:25:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:02,156 INFO L93 Difference]: Finished difference Result 396 states and 444 transitions. [2023-02-17 08:25:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:25:02,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-17 08:25:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:02,158 INFO L225 Difference]: With dead ends: 396 [2023-02-17 08:25:02,158 INFO L226 Difference]: Without dead ends: 396 [2023-02-17 08:25:02,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:25:02,159 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:02,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 308 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:25:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-02-17 08:25:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 382. [2023-02-17 08:25:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 339 states have (on average 1.2212389380530972) internal successors, (414), 369 states have internal predecessors, (414), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 430 transitions. [2023-02-17 08:25:02,165 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 430 transitions. Word has length 53 [2023-02-17 08:25:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:02,166 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 430 transitions. [2023-02-17 08:25:02,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:25:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 430 transitions. [2023-02-17 08:25:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 08:25:02,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:02,167 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:02,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:02,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:02,381 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:02,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156755, now seen corresponding path program 1 times [2023-02-17 08:25:02,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:02,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174066525] [2023-02-17 08:25:02,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:02,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:02,384 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:02,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-17 08:25:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:02,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 08:25:02,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:02,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:02,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:02,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:02,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2023-02-17 08:25:02,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:25:02,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:02,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 136 treesize of output 237 [2023-02-17 08:25:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 08:25:09,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:25:09,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:09,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174066525] [2023-02-17 08:25:09,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174066525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:25:09,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:25:09,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-17 08:25:09,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449899460] [2023-02-17 08:25:09,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:25:09,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:25:09,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:25:09,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:25:09,068 INFO L87 Difference]: Start difference. First operand 382 states and 430 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:10,121 INFO L93 Difference]: Finished difference Result 463 states and 533 transitions. [2023-02-17 08:25:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:25:10,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2023-02-17 08:25:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:10,123 INFO L225 Difference]: With dead ends: 463 [2023-02-17 08:25:10,124 INFO L226 Difference]: Without dead ends: 463 [2023-02-17 08:25:10,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:25:10,124 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 218 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:10,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 528 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 08:25:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-02-17 08:25:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 402. [2023-02-17 08:25:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 359 states have (on average 1.2256267409470751) internal successors, (440), 388 states have internal predecessors, (440), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 456 transitions. [2023-02-17 08:25:10,132 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 456 transitions. Word has length 54 [2023-02-17 08:25:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:10,132 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 456 transitions. [2023-02-17 08:25:10,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 456 transitions. [2023-02-17 08:25:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 08:25:10,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:10,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:10,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:10,346 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156754, now seen corresponding path program 1 times [2023-02-17 08:25:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:10,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78030286] [2023-02-17 08:25:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:10,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:10,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:10,349 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:10,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-17 08:25:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:10,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-17 08:25:10,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:10,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:10,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:10,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:25:10,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:10,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:10,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:25:10,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:25:10,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:10,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 69 [2023-02-17 08:25:10,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:10,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2023-02-17 08:25:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:10,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:25:10,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:10,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78030286] [2023-02-17 08:25:10,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78030286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:25:10,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:25:10,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 08:25:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143366659] [2023-02-17 08:25:10,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:25:10,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:25:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:25:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:25:10,858 INFO L87 Difference]: Start difference. First operand 402 states and 456 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:12,228 INFO L93 Difference]: Finished difference Result 512 states and 566 transitions. [2023-02-17 08:25:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 08:25:12,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2023-02-17 08:25:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:12,230 INFO L225 Difference]: With dead ends: 512 [2023-02-17 08:25:12,230 INFO L226 Difference]: Without dead ends: 512 [2023-02-17 08:25:12,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:25:12,231 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 412 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:12,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 554 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 08:25:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-02-17 08:25:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 402. [2023-02-17 08:25:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 359 states have (on average 1.2200557103064067) internal successors, (438), 388 states have internal predecessors, (438), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 454 transitions. [2023-02-17 08:25:12,238 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 454 transitions. Word has length 54 [2023-02-17 08:25:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:12,238 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 454 transitions. [2023-02-17 08:25:12,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 454 transitions. [2023-02-17 08:25:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-17 08:25:12,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:12,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:12,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 (38)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:12,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:12,454 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1610777396, now seen corresponding path program 1 times [2023-02-17 08:25:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:12,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481407142] [2023-02-17 08:25:12,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:12,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:12,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:12,456 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:12,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-17 08:25:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:12,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 08:25:12,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:12,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:12,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:13,008 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3188 (_ BitVec 32)) (v_ArrVal_3187 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3188) |c_create_data_#t~malloc7.base| v_ArrVal_3187))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_3189 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3189) |c_create_data_#t~malloc7.base|))))) is different from true [2023-02-17 08:25:13,012 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3188 (_ BitVec 32)) (v_ArrVal_3187 (_ BitVec 32)) (v_ArrVal_3189 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3188) |create_data_#t~malloc7.base| v_ArrVal_3187)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3189) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:25:13,036 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3188 (_ BitVec 32)) (v_ArrVal_3187 (_ BitVec 32)) (v_ArrVal_3189 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3189) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3188) |create_data_#t~malloc7.base| v_ArrVal_3187) create_data_~nextData~0.base (_ bv16 32))))) is different from true [2023-02-17 08:25:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:13,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:13,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:13,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 82 [2023-02-17 08:25:13,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:13,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2023-02-17 08:25:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 08:25:13,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:15,111 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_3204 (_ BitVec 1)) (v_create_data_~data~0.base_70 (_ BitVec 32)) (v_ArrVal_3203 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_create_data_~data~0.base_70 v_ArrVal_3204) v_ArrVal_3203))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_70)))))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (and (or .cse0 (bvule (_ bv0 32) |c_ULTIMATE.start_append_~node~0#1.offset|)) (forall ((v_create_data_~data~0.base_70 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_70))) (forall ((v_ArrVal_3204 (_ BitVec 1)) (v_ArrVal_3203 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_create_data_~data~0.base_70 v_ArrVal_3204) v_ArrVal_3203))) (forall ((v_ArrVal_3201 (_ BitVec 32)) (v_ArrVal_3202 (_ BitVec 32)) (v_create_data_~nextData~0.base_22 (_ BitVec 32))) (bvule .cse1 (select (store (store (store |c_#length| v_create_data_~data~0.base_70 v_ArrVal_3201) v_ArrVal_3203 v_ArrVal_3202) v_create_data_~nextData~0.base_22 (_ bv16 32)) |c_ULTIMATE.start_append_~node~0#1.base|))))))) (or .cse0 (bvule |c_ULTIMATE.start_append_~node~0#1.offset| .cse1)))) is different from false [2023-02-17 08:25:15,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:15,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481407142] [2023-02-17 08:25:15,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481407142] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:25:15,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1658281792] [2023-02-17 08:25:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:15,121 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:15,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:25:15,122 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:25:15,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-02-17 08:25:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:15,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:25:15,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:15,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:15,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:15,865 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3391 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3390 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3391) |create_data_#t~malloc7.base| v_ArrVal_3390) c_create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:25:15,878 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3391 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3390 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3391) |create_data_#t~malloc7.base| v_ArrVal_3390) create_data_~nextData~0.base (_ bv16 32))))) is different from true [2023-02-17 08:25:15,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:15,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:15,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:15,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:15,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 08:25:15,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:15,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 08:25:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 08:25:15,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1658281792] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:25:17,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:25:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-17 08:25:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226942903] [2023-02-17 08:25:17,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:25:17,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:25:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:25:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=46, Unknown=6, NotChecked=102, Total=182 [2023-02-17 08:25:17,962 INFO L87 Difference]: Start difference. First operand 402 states and 454 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:25:18,137 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_3391 (_ BitVec 32)) (v_ArrVal_3390 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3391) |create_data_#t~malloc7.base| v_ArrVal_3390))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) (exists ((v_ArrVal_3188 (_ BitVec 32)) (v_ArrVal_3187 (_ BitVec 32)) (v_ArrVal_3189 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3188) |create_data_#t~malloc7.base| v_ArrVal_3187)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3189) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2023-02-17 08:25:18,154 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3391 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3390 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3391) |create_data_#t~malloc7.base| v_ArrVal_3390) c_create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) (exists ((v_ArrVal_3188 (_ BitVec 32)) (v_ArrVal_3187 (_ BitVec 32)) (v_ArrVal_3189 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3189) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3188) |create_data_#t~malloc7.base| v_ArrVal_3187) create_data_~nextData~0.base (_ bv16 32)))))) is different from true [2023-02-17 08:25:18,214 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3391 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3390 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3391) |create_data_#t~malloc7.base| v_ArrVal_3390) create_data_~nextData~0.base (_ bv16 32))))) (exists ((v_ArrVal_3188 (_ BitVec 32)) (v_ArrVal_3187 (_ BitVec 32)) (v_ArrVal_3189 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3189) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3188) |create_data_#t~malloc7.base| v_ArrVal_3187) create_data_~nextData~0.base (_ bv16 32)))))) is different from true [2023-02-17 08:25:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:18,804 INFO L93 Difference]: Finished difference Result 560 states and 629 transitions. [2023-02-17 08:25:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:25:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-02-17 08:25:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:18,806 INFO L225 Difference]: With dead ends: 560 [2023-02-17 08:25:18,806 INFO L226 Difference]: Without dead ends: 560 [2023-02-17 08:25:18,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=37, Invalid=62, Unknown=9, NotChecked=198, Total=306 [2023-02-17 08:25:18,807 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 116 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 2 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:18,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 532 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 407 Invalid, 15 Unknown, 749 Unchecked, 0.7s Time] [2023-02-17 08:25:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-02-17 08:25:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 423. [2023-02-17 08:25:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 379 states have (on average 1.2163588390501319) internal successors, (461), 408 states have internal predecessors, (461), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (14), 10 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-17 08:25:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 479 transitions. [2023-02-17 08:25:18,815 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 479 transitions. Word has length 55 [2023-02-17 08:25:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:18,815 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 479 transitions. [2023-02-17 08:25:18,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:25:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 479 transitions. [2023-02-17 08:25:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 08:25:18,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:18,817 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:18,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-02-17 08:25:19,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-02-17 08:25:19,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:19,231 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash 948367783, now seen corresponding path program 1 times [2023-02-17 08:25:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:19,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827038488] [2023-02-17 08:25:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:19,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:19,233 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:19,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-17 08:25:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:19,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:25:19,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:19,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:19,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:19,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:25:19,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:25:19,665 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_115 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3523 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3523) v_arrayElimCell_115 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:25:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:19,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:19,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:25:19,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:19,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:25:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2023-02-17 08:25:19,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:19,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:19,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827038488] [2023-02-17 08:25:19,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827038488] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:25:19,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [282985118] [2023-02-17 08:25:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:25:19,813 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:25:19,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2023-02-17 08:25:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:20,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:25:20,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:20,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:20,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:20,372 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_3653 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3653) |c_create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-17 08:25:20,375 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3653 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3653) |create_data_#t~malloc7.base| (_ bv80 32))))) is different from true [2023-02-17 08:25:20,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:20,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:20,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:25:20,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:20,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:25:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-17 08:25:20,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:25:20,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [282985118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:25:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:25:20,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-17 08:25:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559513807] [2023-02-17 08:25:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:25:20,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:25:20,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:25:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=57, Unknown=3, NotChecked=48, Total=132 [2023-02-17 08:25:20,436 INFO L87 Difference]: Start difference. First operand 423 states and 479 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:20,955 INFO L93 Difference]: Finished difference Result 526 states and 588 transitions. [2023-02-17 08:25:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:25:20,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-02-17 08:25:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:20,957 INFO L225 Difference]: With dead ends: 526 [2023-02-17 08:25:20,957 INFO L226 Difference]: Without dead ends: 526 [2023-02-17 08:25:20,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=57, Unknown=3, NotChecked=48, Total=132 [2023-02-17 08:25:20,958 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:20,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 268 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 502 Unchecked, 0.5s Time] [2023-02-17 08:25:20,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-02-17 08:25:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 403. [2023-02-17 08:25:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 361 states have (on average 1.2105263157894737) internal successors, (437), 390 states have internal predecessors, (437), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 453 transitions. [2023-02-17 08:25:20,964 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 453 transitions. Word has length 56 [2023-02-17 08:25:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:20,964 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 453 transitions. [2023-02-17 08:25:20,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 453 transitions. [2023-02-17 08:25:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 08:25:20,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:20,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:20,979 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 (41)] Ended with exit code 0 [2023-02-17 08:25:21,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:21,378 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1897094198, now seen corresponding path program 1 times [2023-02-17 08:25:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737793428] [2023-02-17 08:25:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:21,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:21,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:21,381 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:21,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-02-17 08:25:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:21,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:25:21,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:21,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:21,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-17 08:25:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:21,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:25:21,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:21,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737793428] [2023-02-17 08:25:21,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737793428] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:25:21,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:25:21,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:25:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544112896] [2023-02-17 08:25:21,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:25:21,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:25:21,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:21,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:25:21,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:25:21,706 INFO L87 Difference]: Start difference. First operand 403 states and 453 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:22,030 INFO L93 Difference]: Finished difference Result 441 states and 491 transitions. [2023-02-17 08:25:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:25:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-17 08:25:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:22,032 INFO L225 Difference]: With dead ends: 441 [2023-02-17 08:25:22,033 INFO L226 Difference]: Without dead ends: 441 [2023-02-17 08:25:22,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:25:22,033 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 150 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:22,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 353 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:25:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-02-17 08:25:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 405. [2023-02-17 08:25:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 363 states have (on average 1.209366391184573) internal successors, (439), 392 states have internal predecessors, (439), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 455 transitions. [2023-02-17 08:25:22,040 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 455 transitions. Word has length 57 [2023-02-17 08:25:22,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:22,040 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 455 transitions. [2023-02-17 08:25:22,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 455 transitions. [2023-02-17 08:25:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 08:25:22,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:22,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:22,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2023-02-17 08:25:22,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:22,254 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093746, now seen corresponding path program 1 times [2023-02-17 08:25:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019107240] [2023-02-17 08:25:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:22,256 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:22,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-02-17 08:25:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:22,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:25:22,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:22,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:22,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 08:25:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:22,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:25:22,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:22,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019107240] [2023-02-17 08:25:22,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019107240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:25:22,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:25:22,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:25:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241099104] [2023-02-17 08:25:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:25:22,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:25:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:22,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:25:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:25:22,558 INFO L87 Difference]: Start difference. First operand 405 states and 455 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:22,926 INFO L93 Difference]: Finished difference Result 423 states and 473 transitions. [2023-02-17 08:25:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:25:22,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-17 08:25:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:22,928 INFO L225 Difference]: With dead ends: 423 [2023-02-17 08:25:22,928 INFO L226 Difference]: Without dead ends: 423 [2023-02-17 08:25:22,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:25:22,929 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:22,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 338 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:25:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-02-17 08:25:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 407. [2023-02-17 08:25:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 365 states have (on average 1.210958904109589) internal successors, (442), 394 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-17 08:25:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 458 transitions. [2023-02-17 08:25:22,936 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 458 transitions. Word has length 57 [2023-02-17 08:25:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:22,936 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 458 transitions. [2023-02-17 08:25:22,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 458 transitions. [2023-02-17 08:25:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 08:25:22,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:22,937 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:22,948 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 (44)] Ended with exit code 0 [2023-02-17 08:25:23,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:23,148 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093745, now seen corresponding path program 1 times [2023-02-17 08:25:23,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:23,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920962983] [2023-02-17 08:25:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:23,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-17 08:25:23,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:23,150 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:23,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 (45)] Waiting until timeout for monitored process [2023-02-17 08:25:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:23,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 08:25:23,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:23,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:23,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:23,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:25:23,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:25:23,586 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_124 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4006 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4006) v_arrayElimCell_124 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:25:23,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:23,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:23,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:25:23,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:23,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 11 treesize of output 15 [2023-02-17 08:25:23,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:23,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:23,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:25:23,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-02-17 08:25:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 08:25:23,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:23,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-17 08:25:23,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2023-02-17 08:25:23,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2023-02-17 08:25:23,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-17 08:25:34,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:34,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920962983] [2023-02-17 08:25:34,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920962983] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:25:34,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [75537036] [2023-02-17 08:25:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:34,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:25:34,107 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:25:34,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-02-17 08:25:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:34,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 08:25:34,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:34,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:34,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:34,953 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (exists ((v_ArrVal_4136 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4136) |create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:25:34,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:34,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:34,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:25:34,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:34,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:25:35,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:35,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:25:35,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:25:35,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-02-17 08:25:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:35,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:25:35,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [75537036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:25:35,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:25:35,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-17 08:25:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496236816] [2023-02-17 08:25:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:25:35,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:25:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:25:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=5, NotChecked=66, Total=380 [2023-02-17 08:25:35,767 INFO L87 Difference]: Start difference. First operand 407 states and 458 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:25:37,689 INFO L93 Difference]: Finished difference Result 699 states and 791 transitions. [2023-02-17 08:25:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:25:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-17 08:25:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:25:37,693 INFO L225 Difference]: With dead ends: 699 [2023-02-17 08:25:37,693 INFO L226 Difference]: Without dead ends: 699 [2023-02-17 08:25:37,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=88, Invalid=335, Unknown=5, NotChecked=78, Total=506 [2023-02-17 08:25:37,694 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 300 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 08:25:37,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 514 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 437 Invalid, 0 Unknown, 269 Unchecked, 0.9s Time] [2023-02-17 08:25:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-02-17 08:25:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 518. [2023-02-17 08:25:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 470 states have (on average 1.2148936170212765) internal successors, (571), 497 states have internal predecessors, (571), 8 states have call successors, (8), 4 states have call predecessors, (8), 11 states have return successors, (28), 16 states have call predecessors, (28), 8 states have call successors, (28) [2023-02-17 08:25:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 607 transitions. [2023-02-17 08:25:37,704 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 607 transitions. Word has length 57 [2023-02-17 08:25:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:25:37,704 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 607 transitions. [2023-02-17 08:25:37,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:25:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 607 transitions. [2023-02-17 08:25:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 08:25:37,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:25:37,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:25:37,723 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 (45)] Forceful destruction successful, exit code 0 [2023-02-17 08:25:37,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2023-02-17 08:25:38,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:38,120 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:25:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:25:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854147, now seen corresponding path program 1 times [2023-02-17 08:25:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:25:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484051747] [2023-02-17 08:25:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:38,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:25:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:25:38,122 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:25:38,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-02-17 08:25:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:38,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 08:25:38,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:38,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:38,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-17 08:25:38,647 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 5 [2023-02-17 08:25:38,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:25:38,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:38,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 64 [2023-02-17 08:25:38,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2023-02-17 08:25:38,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:38,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 64 [2023-02-17 08:25:38,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2023-02-17 08:25:38,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-02-17 08:25:38,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:38,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:38,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:38,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:38,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 68 [2023-02-17 08:25:38,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:38,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:38,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2023-02-17 08:25:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 08:25:39,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:39,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:25:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484051747] [2023-02-17 08:25:39,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484051747] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:25:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [241562473] [2023-02-17 08:25:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:25:39,331 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:25:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:25:39,333 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:25:39,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2023-02-17 08:25:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:25:40,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:25:40,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:25:40,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:25:40,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:40,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:25:40,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:25:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:42,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:25:42,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:25:42,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 73 [2023-02-17 08:25:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:25:43,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:25:51,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [241562473] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:25:51,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:25:51,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2023-02-17 08:25:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128567782] [2023-02-17 08:25:51,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:25:51,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 08:25:51,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:25:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 08:25:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=394, Unknown=10, NotChecked=0, Total=462 [2023-02-17 08:25:51,003 INFO L87 Difference]: Start difference. First operand 518 states and 607 transitions. Second operand has 19 states, 18 states have (on average 5.166666666666667) internal successors, (93), 19 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:25:53,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:01,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:03,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:07,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:09,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:13,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:16,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:19,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:26:22,929 INFO L93 Difference]: Finished difference Result 937 states and 1080 transitions. [2023-02-17 08:26:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 08:26:22,930 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.166666666666667) internal successors, (93), 19 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2023-02-17 08:26:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:26:22,933 INFO L225 Difference]: With dead ends: 937 [2023-02-17 08:26:22,933 INFO L226 Difference]: Without dead ends: 937 [2023-02-17 08:26:22,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=220, Invalid=1235, Unknown=27, NotChecked=0, Total=1482 [2023-02-17 08:26:22,935 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 1004 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 65 mSolverCounterUnsat, 450 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 450 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:26:22,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 987 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1398 Invalid, 450 Unknown, 0 Unchecked, 28.5s Time] [2023-02-17 08:26:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2023-02-17 08:26:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 654. [2023-02-17 08:26:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 599 states have (on average 1.2220367278797997) internal successors, (732), 619 states have internal predecessors, (732), 12 states have call successors, (12), 5 states have call predecessors, (12), 14 states have return successors, (54), 29 states have call predecessors, (54), 12 states have call successors, (54) [2023-02-17 08:26:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 798 transitions. [2023-02-17 08:26:22,948 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 798 transitions. Word has length 57 [2023-02-17 08:26:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:26:22,949 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 798 transitions. [2023-02-17 08:26:22,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.166666666666667) internal successors, (93), 19 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:26:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 798 transitions. [2023-02-17 08:26:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 08:26:22,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:26:22,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:26:22,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2023-02-17 08:26:23,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2023-02-17 08:26:23,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:23,360 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:26:23,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:26:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2094859878, now seen corresponding path program 1 times [2023-02-17 08:26:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:26:23,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744769636] [2023-02-17 08:26:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:23,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:23,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:26:23,362 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:26:23,363 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 (49)] Waiting until timeout for monitored process [2023-02-17 08:26:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:24,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:26:24,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:24,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:24,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:26,121 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4736 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4737 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4737) |create_data_#t~malloc7.base| v_ArrVal_4736) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:26:26,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:26,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:26,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:26,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 08:26:26,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:26,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 08:26:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 08:26:26,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:26:26,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:26:26,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744769636] [2023-02-17 08:26:26,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744769636] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:26:26,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [820145485] [2023-02-17 08:26:26,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:26:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:26:26,243 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:26:26,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (50)] Waiting until timeout for monitored process [2023-02-17 08:26:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:27,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:26:27,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:27,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:27,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:27,047 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4934 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4935 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4935) |create_data_#t~malloc7.base| v_ArrVal_4934)))) is different from true [2023-02-17 08:26:27,074 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4934 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4935 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4935) |create_data_#t~malloc7.base| v_ArrVal_4934) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:26:27,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:27,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:27,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:27,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:27,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-17 08:26:27,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:27,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-17 08:26:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-17 08:26:27,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:26:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [820145485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:26:31,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:26:31,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2023-02-17 08:26:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931755813] [2023-02-17 08:26:31,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:26:31,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:26:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:26:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:26:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=68, Unknown=6, NotChecked=54, Total=156 [2023-02-17 08:26:31,169 INFO L87 Difference]: Start difference. First operand 654 states and 798 transitions. Second operand has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:26:33,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:35,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:35,266 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |c_create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_4934 (_ BitVec 32)) (v_ArrVal_4935 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4935) |c_create_data_#t~malloc7.base| v_ArrVal_4934))))) (exists ((v_ArrVal_4934 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4935 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4935) |create_data_#t~malloc7.base| v_ArrVal_4934))))) is different from true [2023-02-17 08:26:35,272 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_4736 (_ BitVec 32)) (v_ArrVal_4737 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4737) |create_data_#t~malloc7.base| v_ArrVal_4736))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) (exists ((v_ArrVal_4934 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4935 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4935) |create_data_#t~malloc7.base| v_ArrVal_4934))))) is different from true [2023-02-17 08:26:35,424 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4736 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4737 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4737) |create_data_#t~malloc7.base| v_ArrVal_4736) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) (exists ((v_ArrVal_4934 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4935 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4935) |create_data_#t~malloc7.base| v_ArrVal_4934) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2023-02-17 08:26:37,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:39,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:41,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:26:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:26:42,179 INFO L93 Difference]: Finished difference Result 907 states and 1105 transitions. [2023-02-17 08:26:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:26:42,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2023-02-17 08:26:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:26:42,183 INFO L225 Difference]: With dead ends: 907 [2023-02-17 08:26:42,183 INFO L226 Difference]: Without dead ends: 907 [2023-02-17 08:26:42,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=34, Invalid=71, Unknown=9, NotChecked=126, Total=240 [2023-02-17 08:26:42,184 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 113 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:26:42,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 539 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 28 Unknown, 555 Unchecked, 11.0s Time] [2023-02-17 08:26:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2023-02-17 08:26:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 666. [2023-02-17 08:26:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 611 states have (on average 1.2242225859247136) internal successors, (748), 631 states have internal predecessors, (748), 12 states have call successors, (12), 5 states have call predecessors, (12), 14 states have return successors, (54), 29 states have call predecessors, (54), 12 states have call successors, (54) [2023-02-17 08:26:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 814 transitions. [2023-02-17 08:26:42,197 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 814 transitions. Word has length 59 [2023-02-17 08:26:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:26:42,197 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 814 transitions. [2023-02-17 08:26:42,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:26:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 814 transitions. [2023-02-17 08:26:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 08:26:42,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:26:42,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:26:42,214 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 (49)] Forceful destruction successful, exit code 0 [2023-02-17 08:26:42,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (50)] Ended with exit code 0 [2023-02-17 08:26:42,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:26:42,614 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:26:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:26:42,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1155057627, now seen corresponding path program 1 times [2023-02-17 08:26:42,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:26:42,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230198262] [2023-02-17 08:26:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:42,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:42,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:26:42,616 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:26:42,617 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 (51)] Waiting until timeout for monitored process [2023-02-17 08:26:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:42,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:26:42,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:42,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:42,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 08:26:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:26:42,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:26:42,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:26:42,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230198262] [2023-02-17 08:26:42,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230198262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:26:42,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:26:42,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:26:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259051137] [2023-02-17 08:26:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:26:42,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:26:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:26:42,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:26:42,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:26:42,960 INFO L87 Difference]: Start difference. First operand 666 states and 814 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:26:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:26:43,420 INFO L93 Difference]: Finished difference Result 681 states and 828 transitions. [2023-02-17 08:26:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:26:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 60 [2023-02-17 08:26:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:26:43,423 INFO L225 Difference]: With dead ends: 681 [2023-02-17 08:26:43,423 INFO L226 Difference]: Without dead ends: 681 [2023-02-17 08:26:43,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:26:43,424 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 130 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:26:43,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 333 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:26:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-02-17 08:26:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 669. [2023-02-17 08:26:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 614 states have (on average 1.224755700325733) internal successors, (752), 634 states have internal predecessors, (752), 12 states have call successors, (12), 5 states have call predecessors, (12), 14 states have return successors, (54), 29 states have call predecessors, (54), 12 states have call successors, (54) [2023-02-17 08:26:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 818 transitions. [2023-02-17 08:26:43,438 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 818 transitions. Word has length 60 [2023-02-17 08:26:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:26:43,438 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 818 transitions. [2023-02-17 08:26:43,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:26:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 818 transitions. [2023-02-17 08:26:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 08:26:43,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:26:43,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:26:43,455 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 (51)] Forceful destruction successful, exit code 0 [2023-02-17 08:26:43,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:43,653 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:26:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:26:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1155057628, now seen corresponding path program 1 times [2023-02-17 08:26:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:26:43,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886915950] [2023-02-17 08:26:43,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:43,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:43,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:26:43,655 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:26:43,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-02-17 08:26:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:43,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:26:43,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:44,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:44,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:44,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:26:44,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-17 08:26:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:26:44,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:26:44,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:26:44,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886915950] [2023-02-17 08:26:44,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886915950] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:26:44,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:26:44,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:26:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854895969] [2023-02-17 08:26:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:26:44,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:26:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:26:44,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:26:44,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:26:44,034 INFO L87 Difference]: Start difference. First operand 669 states and 818 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:26:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:26:44,587 INFO L93 Difference]: Finished difference Result 697 states and 844 transitions. [2023-02-17 08:26:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:26:44,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 60 [2023-02-17 08:26:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:26:44,591 INFO L225 Difference]: With dead ends: 697 [2023-02-17 08:26:44,591 INFO L226 Difference]: Without dead ends: 697 [2023-02-17 08:26:44,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:26:44,592 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 159 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:26:44,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 327 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:26:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-02-17 08:26:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 669. [2023-02-17 08:26:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 614 states have (on average 1.223127035830619) internal successors, (751), 634 states have internal predecessors, (751), 12 states have call successors, (12), 5 states have call predecessors, (12), 14 states have return successors, (54), 29 states have call predecessors, (54), 12 states have call successors, (54) [2023-02-17 08:26:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 817 transitions. [2023-02-17 08:26:44,603 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 817 transitions. Word has length 60 [2023-02-17 08:26:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:26:44,603 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 817 transitions. [2023-02-17 08:26:44,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:26:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 817 transitions. [2023-02-17 08:26:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-17 08:26:44,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:26:44,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:26:44,620 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 (52)] Forceful destruction successful, exit code 0 [2023-02-17 08:26:44,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:44,818 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:26:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:26:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1808341621, now seen corresponding path program 1 times [2023-02-17 08:26:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:26:44,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013802577] [2023-02-17 08:26:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:44,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:44,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:26:44,820 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:26:44,821 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 (53)] Waiting until timeout for monitored process [2023-02-17 08:26:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:45,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 08:26:45,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:45,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:45,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:45,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:26:45,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-02-17 08:26:45,291 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5299 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_164 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5299) v_arrayElimCell_164 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:26:45,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:45,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:45,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:26:45,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:45,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:26:45,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:45,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:45,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:26:45,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-02-17 08:26:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-17 08:26:45,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:26:45,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-17 08:26:45,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2023-02-17 08:26:45,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2023-02-17 08:26:45,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-17 08:26:47,757 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~pointerToList#1.base|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (let ((.cse4 (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) (.cse3 (not .cse1)) (.cse7 (bvadd (_ bv4 32) .cse0)) (.cse5 (not .cse2))) (let ((.cse9 (or .cse3 (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse37 (select (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)) |c_ULTIMATE.start_append_~node~0#1.base|))) (or (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) .cse37) (bvule .cse7 .cse37) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109)))))) .cse5)) (.cse22 (let ((.cse36 (or .cse3 .cse4 .cse5))) (let ((.cse34 (and (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))) (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) (select (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)) v_arrayElimCell_171))))) .cse36))) (and (or .cse34 .cse1) (or .cse34 .cse2) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32))) (or (bvule .cse7 (select (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)) v_arrayElimCell_171)) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) .cse3 .cse5) (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse35 (select (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)) v_arrayElimCell_171))) (or (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) .cse35) (bvule .cse7 .cse35)))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) .cse36))))) (let ((.cse11 (let ((.cse31 (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (or (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) (select (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)) |c_ULTIMATE.start_append_~node~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) .cse3 .cse5))) (let ((.cse26 (and (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse32 (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172))) (.cse33 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (or (bvule .cse32 (select .cse33 |c_ULTIMATE.start_append_~node~0#1.base|)) (forall ((v_arrayElimCell_171 (_ BitVec 32))) (bvule .cse32 (select .cse33 v_arrayElimCell_171)))))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) .cse31))) (and (or .cse26 .cse1) (or .cse22 .cse3 .cse5) (or .cse26 .cse2) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse27 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (or (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) (select .cse27 |c_ULTIMATE.start_append_~node~0#1.base|)) (bvule .cse7 (select .cse27 v_arrayElimCell_171)) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109)))))) .cse3 .cse5) (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse28 (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172))) (.cse30 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (or (forall ((v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse29 (select .cse30 v_arrayElimCell_171))) (or (bvule .cse28 .cse29) (bvule .cse7 .cse29)))) (bvule .cse28 (select .cse30 |c_ULTIMATE.start_append_~node~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) .cse31)))) (.cse10 (and .cse9 (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))) (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32))) (let ((.cse25 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_append_~node~0#1.base|))) (or (bvule .cse7 .cse23) (forall ((v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse24 (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)))) (or (bvule .cse24 .cse23) (forall ((v_arrayElimCell_171 (_ BitVec 32))) (bvule .cse24 (select .cse25 v_arrayElimCell_171))))))))))))))) (and (or (and (bvule (_ bv0 32) .cse0) .cse1 .cse2) .cse3 .cse4 .cse5) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse8 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_append_~node~0#1.base|))) (or (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) .cse6) (bvule .cse7 .cse6) (bvule .cse7 (select .cse8 v_arrayElimCell_171)) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))))) .cse3 .cse5) .cse9 (or .cse10 .cse2) (or .cse11 .cse1) (or .cse1 .cse4) (or .cse2 .cse4) (or (let ((.cse12 (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32))) (or (bvule .cse7 (select (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)) |c_ULTIMATE.start_append_~node~0#1.base|)) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) .cse3 .cse5))) (let ((.cse13 (and .cse12 (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))) (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32))) (let ((.cse17 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (or (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) (select .cse17 v_arrayElimCell_171))) (bvule .cse7 (select .cse17 |c_ULTIMATE.start_append_~node~0#1.base|)))))))))) (and .cse12 (or .cse13 .cse1) (or .cse13 .cse2) (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32))) (let ((.cse15 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (or (forall ((v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse14 (select .cse15 v_arrayElimCell_171))) (or (bvule (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)) .cse14) (bvule .cse7 .cse14)))) (bvule .cse7 (select .cse15 |c_ULTIMATE.start_append_~node~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_create_data_~data~0.base_109 (_ BitVec 32))) (let ((.cse16 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (or (bvule .cse7 (select .cse16 |c_ULTIMATE.start_append_~node~0#1.base|)) (bvule .cse7 (select .cse16 v_arrayElimCell_171)) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109)))))) .cse3 .cse5)))) .cse3 .cse5) (or .cse11 .cse2) (forall ((v_create_data_~data~0.base_109 (_ BitVec 32))) (or (forall ((v_ArrVal_5313 (_ BitVec 32)) (v_ArrVal_5312 (_ BitVec 32))) (let ((.cse20 (store (store |c_#length| v_create_data_~data~0.base_109 v_ArrVal_5313) v_ArrVal_5312 (_ bv80 32)))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_append_~node~0#1.base|))) (or (forall ((v_arrayElimCell_172 (_ BitVec 32))) (let ((.cse18 (bvadd (_ bv4 32) (bvadd (_ bv4 32) v_arrayElimCell_172)))) (or (forall ((v_arrayElimCell_171 (_ BitVec 32))) (let ((.cse19 (select .cse20 v_arrayElimCell_171))) (or (bvule .cse18 .cse19) (bvule .cse7 .cse19)))) (bvule .cse18 .cse21)))) (bvule .cse7 .cse21))))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_109))))) (or .cse4 (bvule .cse0 .cse7)) (or .cse10 .cse1) (or .cse1 .cse22) (or .cse2 .cse22)))))) is different from false [2023-02-17 08:26:47,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:26:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013802577] [2023-02-17 08:26:47,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013802577] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:26:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679664153] [2023-02-17 08:26:47,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:26:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:26:47,796 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:26:47,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2023-02-17 08:26:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:48,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 08:26:48,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:48,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:48,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:26:48,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5431 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5431) |c_create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-17 08:26:48,626 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5431 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5431) |create_data_#t~malloc7.base| (_ bv80 32))))) is different from true [2023-02-17 08:26:48,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:26:48,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:48,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-17 08:26:48,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:48,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:26:48,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:48,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:48,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-17 08:26:48,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2023-02-17 08:26:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:26:48,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:26:48,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1679664153] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:26:48,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:26:48,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 16 [2023-02-17 08:26:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576898498] [2023-02-17 08:26:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:26:48,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:26:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:26:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:26:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=228, Unknown=4, NotChecked=132, Total=420 [2023-02-17 08:26:48,914 INFO L87 Difference]: Start difference. First operand 669 states and 817 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:26:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:26:50,091 INFO L93 Difference]: Finished difference Result 949 states and 1142 transitions. [2023-02-17 08:26:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:26:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2023-02-17 08:26:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:26:50,096 INFO L225 Difference]: With dead ends: 949 [2023-02-17 08:26:50,096 INFO L226 Difference]: Without dead ends: 949 [2023-02-17 08:26:50,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=88, Invalid=304, Unknown=4, NotChecked=156, Total=552 [2023-02-17 08:26:50,097 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 254 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:26:50,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 599 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 511 Unchecked, 1.1s Time] [2023-02-17 08:26:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-02-17 08:26:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 717. [2023-02-17 08:26:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 660 states have (on average 1.2181818181818183) internal successors, (804), 679 states have internal predecessors, (804), 12 states have call successors, (12), 5 states have call predecessors, (12), 16 states have return successors, (60), 32 states have call predecessors, (60), 12 states have call successors, (60) [2023-02-17 08:26:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 876 transitions. [2023-02-17 08:26:50,110 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 876 transitions. Word has length 61 [2023-02-17 08:26:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:26:50,110 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 876 transitions. [2023-02-17 08:26:50,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:26:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 876 transitions. [2023-02-17 08:26:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-17 08:26:50,111 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:26:50,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:26:50,124 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 (53)] Ended with exit code 0 [2023-02-17 08:26:50,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (54)] Ended with exit code 0 [2023-02-17 08:26:50,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:26:50,517 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-17 08:26:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:26:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1714750009, now seen corresponding path program 1 times [2023-02-17 08:26:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:26:50,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815011498] [2023-02-17 08:26:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:26:50,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:26:50,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:26:50,519 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:26:50,520 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 (55)] Waiting until timeout for monitored process [2023-02-17 08:26:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:26:50,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:26:50,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:26:51,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:51,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:26:51,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:26:51,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:51,016 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 16 treesize of output 44 [2023-02-17 08:26:51,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:26:51,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 186