./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11.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 d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:57:24,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:57:24,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:57:24,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:57:24,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:57:24,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:57:24,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:57:24,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:57:24,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:57:24,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:57:24,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:57:24,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:57:24,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:57:24,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:57:24,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:57:24,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:57:24,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:57:24,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:57:24,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:57:24,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:57:24,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:57:24,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:57:24,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:57:24,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:57:24,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:57:24,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:57:24,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:57:24,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:57:24,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:57:24,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:57:24,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:57:24,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:57:24,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:57:24,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:57:24,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:57:24,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:57:24,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:57:24,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:57:24,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:57:24,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:57:24,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:57:24,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:57:24,668 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:57:24,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:57:24,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:57:24,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:57:24,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:57:24,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:57:24,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:57:24,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:57:24,671 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:57:24,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:57:24,671 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:57:24,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:57:24,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:57:24,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:57:24,673 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:57:24,673 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:57:24,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:57:24,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:57:24,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:57:24,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:57:24,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:57:24,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:57:24,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:57:24,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:57:24,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:57:24,674 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:57:24,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:57:24,675 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:57:24,675 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 -> d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc [2023-02-14 01:57:24,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:57:24,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:57:24,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:57:24,900 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:57:24,901 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:57:24,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-14 01:57:25,885 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:57:26,103 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:57:26,109 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-14 01:57:26,121 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b027510f1/0c46b13767d04cb1af1e6e26f3cde708/FLAG39c631869 [2023-02-14 01:57:26,132 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b027510f1/0c46b13767d04cb1af1e6e26f3cde708 [2023-02-14 01:57:26,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:57:26,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:57:26,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:26,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:57:26,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:57:26,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:26" (1/1) ... [2023-02-14 01:57:26,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6c3ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:26, skipping insertion in model container [2023-02-14 01:57:26,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:26" (1/1) ... [2023-02-14 01:57:26,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:57:26,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:57:26,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:26,552 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-14 01:57:26,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d8e8b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:26, skipping insertion in model container [2023-02-14 01:57:26,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:26,554 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-14 01:57:26,555 INFO L158 Benchmark]: Toolchain (without parser) took 420.06ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 102.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 01:57:26,556 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 01:57:26,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.23ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 102.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 01:57:26,558 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.15ms. Allocated memory is still 113.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.23ms. Allocated memory is still 136.3MB. Free memory was 96.1MB in the beginning and 102.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11.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 d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 01:57:28,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:57:28,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:57:28,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:57:28,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:57:28,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:57:28,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:57:28,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:57:28,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:57:28,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:57:28,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:57:28,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:57:28,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:57:28,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:57:28,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:57:28,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:57:28,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:57:28,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:57:28,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:57:28,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:57:28,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:57:28,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:57:28,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:57:28,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:57:28,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:57:28,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:57:28,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:57:28,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:57:28,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:57:28,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:57:28,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:57:28,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:57:28,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:57:28,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:57:28,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:57:28,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:57:28,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:57:28,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:57:28,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:57:28,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:57:28,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:57:28,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 01:57:28,168 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:57:28,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:57:28,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:57:28,169 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:57:28,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:57:28,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:57:28,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:57:28,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:57:28,170 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:57:28,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:57:28,171 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:57:28,171 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:57:28,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:57:28,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:57:28,173 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 01:57:28,173 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 01:57:28,179 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:57:28,185 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:57:28,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:57:28,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:57:28,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:57:28,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:57:28,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:57:28,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:57:28,186 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 01:57:28,186 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:28,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:57:28,187 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:57:28,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:57:28,187 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 01:57:28,187 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:57:28,187 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 -> d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc [2023-02-14 01:57:28,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:57:28,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:57:28,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:57:28,468 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:57:28,469 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:57:28,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-14 01:57:29,433 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:57:29,651 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:57:29,652 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2023-02-14 01:57:29,662 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83949eeda/4e51775aa9954401a778baf5d7a9b1ff/FLAGfd90cfb12 [2023-02-14 01:57:29,675 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83949eeda/4e51775aa9954401a778baf5d7a9b1ff [2023-02-14 01:57:29,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:57:29,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:57:29,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:29,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:57:29,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:57:29,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:29" (1/1) ... [2023-02-14 01:57:29,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1457e4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:29, skipping insertion in model container [2023-02-14 01:57:29,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:57:29" (1/1) ... [2023-02-14 01:57:29,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:57:29,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:57:30,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:30,063 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-14 01:57:30,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:57:30,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:30,145 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:57:30,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:57:30,234 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:57:30,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30 WrapperNode [2023-02-14 01:57:30,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:57:30,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:57:30,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:57:30,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:57:30,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,312 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 92 [2023-02-14 01:57:30,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:57:30,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:57:30,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:57:30,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:57:30,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,357 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:57:30,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:57:30,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:57:30,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:57:30,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (1/1) ... [2023-02-14 01:57:30,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:57:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:57:30,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 01:57:30,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 01:57:30,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-14 01:57:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-14 01:57:30,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2023-02-14 01:57:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2023-02-14 01:57:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:57:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:57:30,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:57:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:57:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:57:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 01:57:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:57:30,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:57:30,610 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:57:30,624 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:57:30,954 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:57:30,959 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:57:30,959 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-14 01:57:30,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:57:30 BoogieIcfgContainer [2023-02-14 01:57:30,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:57:30,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:57:30,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:57:30,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:57:30,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:57:29" (1/3) ... [2023-02-14 01:57:30,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bfa74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:57:30, skipping insertion in model container [2023-02-14 01:57:30,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:57:30" (2/3) ... [2023-02-14 01:57:30,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bfa74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:57:30, skipping insertion in model container [2023-02-14 01:57:30,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:57:30" (3/3) ... [2023-02-14 01:57:30,966 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11.i [2023-02-14 01:57:30,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:57:30,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-02-14 01:57:31,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:57:31,020 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;@40fb550, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:57:31,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-02-14 01:57:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:57:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:57:31,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:31,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:31,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:31,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:31,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627509, now seen corresponding path program 1 times [2023-02-14 01:57:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:31,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674931431] [2023-02-14 01:57:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:31,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:31,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:31,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:31,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 01:57:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:31,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:57:31,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:57:31,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:31,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:31,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674931431] [2023-02-14 01:57:31,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674931431] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:31,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:31,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:31,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722863109] [2023-02-14 01:57:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:31,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:57:31,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:57:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:31,231 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:31,360 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2023-02-14 01:57:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:57:31,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-14 01:57:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:31,369 INFO L225 Difference]: With dead ends: 157 [2023-02-14 01:57:31,369 INFO L226 Difference]: Without dead ends: 153 [2023-02-14 01:57:31,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:31,372 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:31,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 350 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:57:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-14 01:57:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 87. [2023-02-14 01:57:31,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-14 01:57:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-02-14 01:57:31,404 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 11 [2023-02-14 01:57:31,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:31,405 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-02-14 01:57:31,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-02-14 01:57:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 01:57:31,407 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:31,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:31,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:31,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:31,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash -851123828, now seen corresponding path program 1 times [2023-02-14 01:57:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:31,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993637341] [2023-02-14 01:57:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:31,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:31,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:31,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 01:57:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:31,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:57:31,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:57:31,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:31,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993637341] [2023-02-14 01:57:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993637341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:57:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110737860] [2023-02-14 01:57:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:31,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:57:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:57:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:57:31,747 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:31,935 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2023-02-14 01:57:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:57:31,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-14 01:57:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:31,937 INFO L225 Difference]: With dead ends: 153 [2023-02-14 01:57:31,937 INFO L226 Difference]: Without dead ends: 151 [2023-02-14 01:57:31,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:57:31,938 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:31,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:57:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-14 01:57:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2023-02-14 01:57:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:57:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-02-14 01:57:31,955 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 11 [2023-02-14 01:57:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:31,955 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-02-14 01:57:31,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 01:57:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-02-14 01:57:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:57:31,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:31,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:31,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:32,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:32,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash -470294884, now seen corresponding path program 1 times [2023-02-14 01:57:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:32,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143214985] [2023-02-14 01:57:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:32,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:32,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 01:57:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:32,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:57:32,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:57:32,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:32,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:32,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143214985] [2023-02-14 01:57:32,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143214985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:32,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:32,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526968719] [2023-02-14 01:57:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:32,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:57:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:32,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:57:32,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:32,231 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 01:57:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:32,297 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2023-02-14 01:57:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:57:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-14 01:57:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:32,298 INFO L225 Difference]: With dead ends: 150 [2023-02-14 01:57:32,298 INFO L226 Difference]: Without dead ends: 150 [2023-02-14 01:57:32,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:32,300 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:32,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 444 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:57:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-14 01:57:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 87. [2023-02-14 01:57:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-14 01:57:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-02-14 01:57:32,311 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 17 [2023-02-14 01:57:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:32,312 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-02-14 01:57:32,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 01:57:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-02-14 01:57:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:57:32,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:32,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:32,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:32,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash -470294895, now seen corresponding path program 1 times [2023-02-14 01:57:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:32,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634045661] [2023-02-14 01:57:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:32,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-14 01:57:32,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:32,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:32,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 01:57:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:32,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:57:32,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:32,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:32,635 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |c_#valid|)))) is different from true [2023-02-14 01:57:32,677 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:57:32,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:57:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 01:57:32,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:57:32,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:32,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634045661] [2023-02-14 01:57:32,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634045661] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:57:32,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:32,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-14 01:57:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383874560] [2023-02-14 01:57:32,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:32,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:57:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:32,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:57:32,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-14 01:57:32,840 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:33,086 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-02-14 01:57:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:57:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-14 01:57:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:33,088 INFO L225 Difference]: With dead ends: 114 [2023-02-14 01:57:33,088 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 01:57:33,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-14 01:57:33,089 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:33,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2023-02-14 01:57:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 01:57:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2023-02-14 01:57:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-14 01:57:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-14 01:57:33,095 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 17 [2023-02-14 01:57:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:33,095 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-14 01:57:33,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-14 01:57:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:57:33,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:33,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:33,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:33,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:33,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -470294894, now seen corresponding path program 1 times [2023-02-14 01:57:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606848223] [2023-02-14 01:57:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:33,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:33,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:33,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 01:57:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:33,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:57:33,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:33,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:33,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:57:33,486 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-14 01:57:33,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:33,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:33,514 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:33,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 01:57:33,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:35,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606848223] [2023-02-14 01:57:35,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606848223] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:35,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1146828306] [2023-02-14 01:57:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:35,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:35,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:57:35,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:57:35,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-14 01:57:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:35,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:57:35,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:35,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:57:35,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:35,880 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-14 01:57:35,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:35,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:35,911 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:35,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 01:57:35,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1146828306] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:38,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-14 01:57:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181558276] [2023-02-14 01:57:38,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:38,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:57:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:57:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2023-02-14 01:57:38,058 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:38,661 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2023-02-14 01:57:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:57:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-14 01:57:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:38,663 INFO L225 Difference]: With dead ends: 211 [2023-02-14 01:57:38,663 INFO L226 Difference]: Without dead ends: 211 [2023-02-14 01:57:38,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2023-02-14 01:57:38,663 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:38,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 491 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 527 Invalid, 0 Unknown, 428 Unchecked, 0.5s Time] [2023-02-14 01:57:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-14 01:57:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 141. [2023-02-14 01:57:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 123 states have internal predecessors, (161), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-14 01:57:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 193 transitions. [2023-02-14 01:57:38,670 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 193 transitions. Word has length 17 [2023-02-14 01:57:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:38,671 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 193 transitions. [2023-02-14 01:57:38,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 193 transitions. [2023-02-14 01:57:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:57:38,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:38,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:38,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:38,889 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 (6)] Ended with exit code 0 [2023-02-14 01:57:39,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:39,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -763697902, now seen corresponding path program 1 times [2023-02-14 01:57:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411255944] [2023-02-14 01:57:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:39,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:39,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:39,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:39,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 01:57:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:39,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:57:39,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:57:39,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:39,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:39,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411255944] [2023-02-14 01:57:39,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411255944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:39,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:39,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145549434] [2023-02-14 01:57:39,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:39,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:57:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:39,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:57:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:39,155 INFO L87 Difference]: Start difference. First operand 141 states and 193 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-14 01:57:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:39,193 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2023-02-14 01:57:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:57:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2023-02-14 01:57:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:39,194 INFO L225 Difference]: With dead ends: 123 [2023-02-14 01:57:39,194 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 01:57:39,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:39,195 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:39,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:57:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 01:57:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-14 01:57:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.619047619047619) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-14 01:57:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2023-02-14 01:57:39,213 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 17 [2023-02-14 01:57:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:39,214 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2023-02-14 01:57:39,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-14 01:57:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2023-02-14 01:57:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 01:57:39,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:39,215 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:39,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:39,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:39,421 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash -806735705, now seen corresponding path program 1 times [2023-02-14 01:57:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:39,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251708127] [2023-02-14 01:57:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:39,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-14 01:57:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:39,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:39,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-14 01:57:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:39,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:57:39,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:57:39,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:57:39,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:39,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251708127] [2023-02-14 01:57:39,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251708127] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:57:39,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:39,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-14 01:57:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891071210] [2023-02-14 01:57:39,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:39,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:57:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:57:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:57:39,656 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:57:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:39,825 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2023-02-14 01:57:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:57:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-14 01:57:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:39,827 INFO L225 Difference]: With dead ends: 124 [2023-02-14 01:57:39,827 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 01:57:39,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:57:39,827 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 71 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:39,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 279 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:57:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 01:57:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-14 01:57:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-14 01:57:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2023-02-14 01:57:39,832 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 18 [2023-02-14 01:57:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:39,832 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2023-02-14 01:57:39,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:57:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2023-02-14 01:57:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 01:57:39,833 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:39,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:39,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:40,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:40,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1173731936, now seen corresponding path program 1 times [2023-02-14 01:57:40,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:40,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262107788] [2023-02-14 01:57:40,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:40,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:40,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:40,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-14 01:57:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:40,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 01:57:40,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:40,222 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 1)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))))) is different from true [2023-02-14 01:57:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:57:40,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:40,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ BitVec 32))) (or (= (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18|))))) is different from false [2023-02-14 01:57:40,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:40,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262107788] [2023-02-14 01:57:40,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262107788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:40,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010556161] [2023-02-14 01:57:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:57:40,306 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:57:40,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-14 01:57:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:40,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:57:40,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:57:40,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:40,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21|))) (= (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2023-02-14 01:57:40,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2010556161] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:40,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:40,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-14 01:57:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059024377] [2023-02-14 01:57:40,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:40,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:57:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:57:40,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-14 01:57:40,607 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:57:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:41,161 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2023-02-14 01:57:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:57:41,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-02-14 01:57:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:41,163 INFO L225 Difference]: With dead ends: 177 [2023-02-14 01:57:41,163 INFO L226 Difference]: Without dead ends: 172 [2023-02-14 01:57:41,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-14 01:57:41,164 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 186 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:41,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 436 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 391 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2023-02-14 01:57:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-14 01:57:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 117. [2023-02-14 01:57:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 103 states have internal predecessors, (130), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-14 01:57:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2023-02-14 01:57:41,169 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 21 [2023-02-14 01:57:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:41,169 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2023-02-14 01:57:41,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 01:57:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2023-02-14 01:57:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:57:41,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:41,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:41,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-02-14 01:57:41,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:41,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:41,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:41,572 INFO L85 PathProgramCache]: Analyzing trace with hash -624729604, now seen corresponding path program 1 times [2023-02-14 01:57:41,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:41,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134595747] [2023-02-14 01:57:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:41,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:41,574 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:41,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-14 01:57:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:41,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 01:57:41,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:41,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:41,668 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-14 01:57:41,681 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:57:41,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:57:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-14 01:57:41,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:57:41,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134595747] [2023-02-14 01:57:41,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134595747] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:57:41,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:41,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-14 01:57:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172090691] [2023-02-14 01:57:41,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:41,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:57:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:57:41,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-14 01:57:41,786 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 01:57:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:41,983 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-02-14 01:57:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:57:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-14 01:57:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:41,984 INFO L225 Difference]: With dead ends: 144 [2023-02-14 01:57:41,984 INFO L226 Difference]: Without dead ends: 144 [2023-02-14 01:57:41,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-14 01:57:41,985 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:41,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 253 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2023-02-14 01:57:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-14 01:57:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2023-02-14 01:57:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 113 states have internal predecessors, (148), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-14 01:57:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2023-02-14 01:57:41,988 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 25 [2023-02-14 01:57:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:41,988 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2023-02-14 01:57:41,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 01:57:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2023-02-14 01:57:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:57:41,989 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:41,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:41,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 (12)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:42,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:42,190 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -624729603, now seen corresponding path program 1 times [2023-02-14 01:57:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765231536] [2023-02-14 01:57:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:42,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:42,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:42,192 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-14 01:57:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:42,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 01:57:42,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:42,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:57:42,347 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2023-02-14 01:57:42,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:57:42,365 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 14 [2023-02-14 01:57:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-14 01:57:42,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:42,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:42,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765231536] [2023-02-14 01:57:42,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765231536] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:42,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697255539] [2023-02-14 01:57:42,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:57:42,527 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:57:42,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-14 01:57:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:42,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:57:42,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:42,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:57:42,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:42,756 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_102 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_102) |c_#length|)))) is different from true [2023-02-14 01:57:42,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:42,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:42,776 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:42,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-14 01:57:42,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:45,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [697255539] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:45,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:45,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-14 01:57:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392033020] [2023-02-14 01:57:45,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:57:45,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:45,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:57:45,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=172, Unknown=3, NotChecked=54, Total=272 [2023-02-14 01:57:45,075 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 01:57:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:45,708 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2023-02-14 01:57:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:57:45,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-02-14 01:57:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:45,710 INFO L225 Difference]: With dead ends: 247 [2023-02-14 01:57:45,710 INFO L226 Difference]: Without dead ends: 247 [2023-02-14 01:57:45,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=54, Invalid=223, Unknown=3, NotChecked=62, Total=342 [2023-02-14 01:57:45,710 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:45,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 789 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 571 Invalid, 0 Unknown, 352 Unchecked, 0.6s Time] [2023-02-14 01:57:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-14 01:57:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2023-02-14 01:57:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 161 states have internal predecessors, (225), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-14 01:57:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2023-02-14 01:57:45,715 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 25 [2023-02-14 01:57:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:45,716 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2023-02-14 01:57:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 01:57:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2023-02-14 01:57:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 01:57:45,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:45,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:45,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:45,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:46,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:46,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1130288229, now seen corresponding path program 1 times [2023-02-14 01:57:46,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:46,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253512002] [2023-02-14 01:57:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:46,121 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:46,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-14 01:57:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:46,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:57:46,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 01:57:46,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:46,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253512002] [2023-02-14 01:57:46,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253512002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:46,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:46,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776416095] [2023-02-14 01:57:46,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:46,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:57:46,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:46,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:57:46,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:46,219 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:46,245 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2023-02-14 01:57:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:57:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-14 01:57:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:46,248 INFO L225 Difference]: With dead ends: 119 [2023-02-14 01:57:46,248 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 01:57:46,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:46,248 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:46,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:57:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 01:57:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-14 01:57:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 103 states have internal predecessors, (128), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-14 01:57:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2023-02-14 01:57:46,253 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 25 [2023-02-14 01:57:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:46,253 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2023-02-14 01:57:46,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2023-02-14 01:57:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 01:57:46,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:46,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:46,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:46,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:46,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218693, now seen corresponding path program 1 times [2023-02-14 01:57:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:46,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067646975] [2023-02-14 01:57:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:46,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-14 01:57:46,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:46,468 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:46,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 (16)] Waiting until timeout for monitored process [2023-02-14 01:57:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:46,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:57:46,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 01:57:46,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:46,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067646975] [2023-02-14 01:57:46,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067646975] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:46,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:46,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:46,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801340309] [2023-02-14 01:57:46,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:46,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:57:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:57:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:46,554 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 01:57:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:46,589 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2023-02-14 01:57:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:57:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-14 01:57:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:46,591 INFO L225 Difference]: With dead ends: 162 [2023-02-14 01:57:46,591 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 01:57:46,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:57:46,592 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:46,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:57:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 01:57:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 117. [2023-02-14 01:57:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-14 01:57:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2023-02-14 01:57:46,597 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 26 [2023-02-14 01:57:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:46,598 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2023-02-14 01:57:46,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 01:57:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2023-02-14 01:57:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 01:57:46,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:46,599 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:46,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:46,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:46,806 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1299244922, now seen corresponding path program 1 times [2023-02-14 01:57:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:46,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935471760] [2023-02-14 01:57:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:46,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:46,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:46,809 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:46,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-14 01:57:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:46,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:57:46,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 01:57:47,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 01:57:47,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:47,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935471760] [2023-02-14 01:57:47,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935471760] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:57:47,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:47,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-14 01:57:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946285290] [2023-02-14 01:57:47,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:47,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:57:47,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:47,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:57:47,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:57:47,120 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:57:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:47,341 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2023-02-14 01:57:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:57:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-02-14 01:57:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:47,342 INFO L225 Difference]: With dead ends: 116 [2023-02-14 01:57:47,342 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 01:57:47,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:57:47,343 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 110 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:47,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 315 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:57:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 01:57:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-14 01:57:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 102 states have internal predecessors, (124), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-14 01:57:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2023-02-14 01:57:47,346 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 26 [2023-02-14 01:57:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:47,347 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2023-02-14 01:57:47,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:57:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2023-02-14 01:57:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:57:47,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:47,347 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:47,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-14 01:57:47,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:47,554 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 930272189, now seen corresponding path program 1 times [2023-02-14 01:57:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:47,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195392987] [2023-02-14 01:57:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:47,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:47,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:47,556 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:47,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-14 01:57:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:47,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:57:47,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:47,635 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-14 01:57:47,646 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:57:47,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 01:57:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 01:57:47,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:57:47,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195392987] [2023-02-14 01:57:47,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195392987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:57:47,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:57:47,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:57:47,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870981178] [2023-02-14 01:57:47,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:57:47,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:57:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:57:47,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-14 01:57:47,662 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:47,791 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2023-02-14 01:57:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:57:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-02-14 01:57:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:47,793 INFO L225 Difference]: With dead ends: 145 [2023-02-14 01:57:47,793 INFO L226 Difference]: Without dead ends: 145 [2023-02-14 01:57:47,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-14 01:57:47,793 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:47,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2023-02-14 01:57:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-14 01:57:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2023-02-14 01:57:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 101 states have internal predecessors, (122), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-14 01:57:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2023-02-14 01:57:47,796 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 27 [2023-02-14 01:57:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:47,797 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2023-02-14 01:57:47,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 01:57:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2023-02-14 01:57:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:57:47,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:47,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:47,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:48,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:48,009 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash 930272190, now seen corresponding path program 1 times [2023-02-14 01:57:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:48,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642726136] [2023-02-14 01:57:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:48,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:48,011 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:48,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-14 01:57:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:48,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:57:48,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:48,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:48,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:57:48,169 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |c_#length|)))) is different from true [2023-02-14 01:57:48,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:48,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:48,190 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:48,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:48,227 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_178 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_178) |c_#length|)))) is different from true [2023-02-14 01:57:48,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:48,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:48,246 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:48,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-14 01:57:48,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:49,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:49,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642726136] [2023-02-14 01:57:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642726136] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:49,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1094317588] [2023-02-14 01:57:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:57:49,468 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:57:49,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-14 01:57:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:49,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 01:57:49,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:49,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 7 [2023-02-14 01:57:49,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:57:49,683 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:49,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:49,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:49,735 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_203 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_203))))) is different from true [2023-02-14 01:57:49,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:57:49,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:57:49,756 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:49,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-14 01:57:49,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:49,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1094317588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:49,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:49,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2023-02-14 01:57:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985050541] [2023-02-14 01:57:49,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:49,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:57:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:57:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=153, Unknown=3, NotChecked=78, Total=272 [2023-02-14 01:57:49,894 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 01:57:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:57:50,683 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2023-02-14 01:57:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:57:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-02-14 01:57:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:57:50,687 INFO L225 Difference]: With dead ends: 204 [2023-02-14 01:57:50,687 INFO L226 Difference]: Without dead ends: 204 [2023-02-14 01:57:50,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=62, Invalid=253, Unknown=3, NotChecked=102, Total=420 [2023-02-14 01:57:50,690 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 151 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 22 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:57:50,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 962 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 743 Invalid, 12 Unknown, 393 Unchecked, 0.7s Time] [2023-02-14 01:57:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-14 01:57:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2023-02-14 01:57:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 100 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-14 01:57:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2023-02-14 01:57:50,699 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 27 [2023-02-14 01:57:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:57:50,700 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2023-02-14 01:57:50,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 01:57:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2023-02-14 01:57:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 01:57:50,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:57:50,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:57:50,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:50,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-14 01:57:51,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:51,103 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:57:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:57:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash 638376382, now seen corresponding path program 1 times [2023-02-14 01:57:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:57:51,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490135477] [2023-02-14 01:57:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:57:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:57:51,105 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:57:51,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 (21)] Waiting until timeout for monitored process [2023-02-14 01:57:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:51,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:57:51,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:51,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:57:51,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:51,318 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:57:51,318 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 31 treesize of output 29 [2023-02-14 01:57:51,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:57:51,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2023-02-14 01:57:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 01:57:51,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:51,573 INFO L321 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2023-02-14 01:57:51,573 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 69 treesize of output 68 [2023-02-14 01:57:51,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:57:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490135477] [2023-02-14 01:57:51,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490135477] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338222682] [2023-02-14 01:57:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:57:51,623 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:57:51,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:57:51,624 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:57:51,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-14 01:57:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:57:51,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 01:57:51,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:57:51,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:57:51,874 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:57:51,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:57:51,955 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-14 01:57:53,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32))))) is different from true [2023-02-14 01:57:54,068 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:57:54,069 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 30 treesize of output 31 [2023-02-14 01:57:54,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-14 01:57:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 01:57:54,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:57:54,168 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2023-02-14 01:57:54,169 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 23 treesize of output 22 [2023-02-14 01:57:54,172 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_252) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) is different from false [2023-02-14 01:57:54,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1338222682] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:57:54,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:57:54,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-14 01:57:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227591455] [2023-02-14 01:57:54,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:57:54,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 01:57:54,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:57:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 01:57:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=783, Unknown=2, NotChecked=114, Total=992 [2023-02-14 01:57:54,188 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:06,216 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2023-02-14 01:58:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 01:58:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-14 01:58:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:06,217 INFO L225 Difference]: With dead ends: 183 [2023-02-14 01:58:06,218 INFO L226 Difference]: Without dead ends: 183 [2023-02-14 01:58:06,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=360, Invalid=2093, Unknown=5, NotChecked=194, Total=2652 [2023-02-14 01:58:06,219 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 331 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:06,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1406 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1338 Invalid, 0 Unknown, 148 Unchecked, 1.1s Time] [2023-02-14 01:58:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-14 01:58:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 88. [2023-02-14 01:58:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 01:58:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-14 01:58:06,222 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-14 01:58:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:06,222 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-14 01:58:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-14 01:58:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 01:58:06,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:06,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:58:06,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-02-14 01:58:06,432 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 (21)] Ended with exit code 0 [2023-02-14 01:58:06,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:06,625 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:58:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash 638376383, now seen corresponding path program 1 times [2023-02-14 01:58:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:06,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305379822] [2023-02-14 01:58:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:06,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:06,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:06,627 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:06,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-14 01:58:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:06,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 01:58:06,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:06,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:06,756 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:58:06,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:58:06,795 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-14 01:58:06,799 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-14 01:58:06,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:58:06,940 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 38 treesize of output 37 [2023-02-14 01:58:06,946 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 18 treesize of output 20 [2023-02-14 01:58:07,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:58:07,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 01:58:07,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:58:07,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:58:07,358 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 50 treesize of output 54 [2023-02-14 01:58:07,412 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset|))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_6) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (or (forall ((v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_276) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32))))) is different from false [2023-02-14 01:58:07,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305379822] [2023-02-14 01:58:07,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305379822] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:58:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1627143997] [2023-02-14 01:58:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:58:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:58:07,462 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:58:07,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-14 01:58:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:07,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 01:58:07,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:07,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:58:07,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 01:58:09,839 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:58:09,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:58:09,961 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-14 01:58:09,971 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-14 01:58:10,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-14 01:58:10,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2023-02-14 01:58:10,117 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|)))) (exists ((v_ArrVal_303 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_303))))) is different from true [2023-02-14 01:58:10,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:58:10,141 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:58:10,160 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-14 01:58:10,161 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 22 [2023-02-14 01:58:10,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:58:10,281 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 38 treesize of output 37 [2023-02-14 01:58:10,286 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 18 treesize of output 20 [2023-02-14 01:58:10,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 01:58:10,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 01:58:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-14 01:58:10,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:58:10,552 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_304) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_304) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2023-02-14 01:58:15,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1627143997] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:58:15,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:58:15,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2023-02-14 01:58:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87066507] [2023-02-14 01:58:15,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:58:15,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-14 01:58:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-14 01:58:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1003, Unknown=15, NotChecked=198, Total=1332 [2023-02-14 01:58:15,084 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:17,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:19,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:21,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:25,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:27,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:30,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:32,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:34,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:36,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:58:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:58:36,470 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2023-02-14 01:58:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 01:58:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-14 01:58:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:58:36,471 INFO L225 Difference]: With dead ends: 155 [2023-02-14 01:58:36,471 INFO L226 Difference]: Without dead ends: 153 [2023-02-14 01:58:36,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=252, Invalid=1636, Unknown=16, NotChecked=258, Total=2162 [2023-02-14 01:58:36,472 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 221 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 33 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:58:36,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 709 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 938 Invalid, 9 Unknown, 151 Unchecked, 18.8s Time] [2023-02-14 01:58:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-14 01:58:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 89. [2023-02-14 01:58:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 01:58:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-14 01:58:36,474 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 29 [2023-02-14 01:58:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:58:36,474 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-14 01:58:36,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 01:58:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-14 01:58:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 01:58:36,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:58:36,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-14 01:58:36,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-02-14 01:58:36,685 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 (23)] Ended with exit code 0 [2023-02-14 01:58:36,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:36,878 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:58:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:58:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1844886222, now seen corresponding path program 1 times [2023-02-14 01:58:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:58:36,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105970022] [2023-02-14 01:58:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:36,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:58:36,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:58:36,880 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:58:36,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-14 01:58:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:36,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:58:36,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:41,205 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 1)) (exists ((v_ArrVal_321 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_321))) (and (= |c_#valid| (store (store .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)) |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (select .cse0 |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv0 1))))))) is different from true [2023-02-14 01:58:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 01:58:41,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:58:43,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret44#1.base_35| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_35|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret44#1.base_35| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))))) is different from false [2023-02-14 01:58:43,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:58:43,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105970022] [2023-02-14 01:58:43,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105970022] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:58:43,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1569367737] [2023-02-14 01:58:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:58:43,370 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:58:43,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:58:43,371 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-14 01:58:43,372 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-14 01:58:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:58:43,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-14 01:58:43,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:58:49,952 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_321 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_321))) (let ((.cse0 (store .cse1 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (= |c_#valid| (store .cse0 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 1)) (= (select .cse1 |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse0 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)))) is different from true [2023-02-14 01:58:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 01:58:49,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:58:50,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-02-14 01:58:56,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1569367737] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:58:56,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:58:56,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-02-14 01:58:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000931851] [2023-02-14 01:58:56,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:58:56,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-14 01:58:56,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:58:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-14 01:58:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=12, NotChecked=162, Total=930 [2023-02-14 01:58:56,427 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:59:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:02,139 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2023-02-14 01:59:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 01:59:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2023-02-14 01:59:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:02,141 INFO L225 Difference]: With dead ends: 128 [2023-02-14 01:59:02,141 INFO L226 Difference]: Without dead ends: 120 [2023-02-14 01:59:02,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=12, NotChecked=228, Total=1722 [2023-02-14 01:59:02,142 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 116 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:02,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 709 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 806 Invalid, 4 Unknown, 254 Unchecked, 1.2s Time] [2023-02-14 01:59:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-14 01:59:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2023-02-14 01:59:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 01:59:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-14 01:59:02,145 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 32 [2023-02-14 01:59:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:02,145 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-14 01:59:02,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 01:59:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-14 01:59:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 01:59:02,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:02,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:02,148 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-14 01:59:02,354 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 (25)] Ended with exit code 0 [2023-02-14 01:59:02,548 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-14 01:59:02,548 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:59:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -316571990, now seen corresponding path program 1 times [2023-02-14 01:59:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536122651] [2023-02-14 01:59:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:02,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:02,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:02,550 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:02,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-14 01:59:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:02,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 01:59:02,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:02,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:02,680 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:59:02,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:59:02,702 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-14 01:59:02,707 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-14 01:59:04,746 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17|)))) is different from true [2023-02-14 01:59:04,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:08,901 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-14 01:59:08,901 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 42 treesize of output 32 [2023-02-14 01:59:08,905 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 30 treesize of output 32 [2023-02-14 01:59:08,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-02-14 01:59:09,051 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 01:59:09,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-14 01:59:09,104 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_378 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_378) |c_#valid|)))) is different from true [2023-02-14 01:59:09,130 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:59:09,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:59:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-14 01:59:09,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:59:09,642 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |c_ULTIMATE.start_entry_point_#t~ret45#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_375) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (_ bv0 1))) is different from false [2023-02-14 01:59:09,656 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 109 treesize of output 76 [2023-02-14 01:59:09,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_34| (_ BitVec 32)) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_375) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) is different from false [2023-02-14 01:59:09,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:59:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536122651] [2023-02-14 01:59:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536122651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:59:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1941151119] [2023-02-14 01:59:09,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:09,665 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:59:09,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:59:09,666 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-14 01:59:09,667 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-14 01:59:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:09,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 01:59:09,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:09,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:11,976 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:59:11,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:59:12,067 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-14 01:59:12,075 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-14 01:59:12,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:12,523 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:59:12,523 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 42 treesize of output 32 [2023-02-14 01:59:12,527 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 37 treesize of output 37 [2023-02-14 01:59:12,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-02-14 01:59:12,842 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 01:59:12,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-02-14 01:59:12,856 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_412 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_412) |c_#valid|)))) is different from true [2023-02-14 01:59:12,881 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 01:59:12,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 01:59:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-14 01:59:12,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:59:13,067 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |c_ULTIMATE.start_entry_point_~fe~1#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_409) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))))) is different from false [2023-02-14 01:59:13,319 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 109 treesize of output 76 [2023-02-14 01:59:13,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_37| (_ BitVec 32)) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_409) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) is different from false [2023-02-14 01:59:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1941151119] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:59:13,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:59:13,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2023-02-14 01:59:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704763627] [2023-02-14 01:59:13,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:59:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-14 01:59:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:59:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-14 01:59:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1494, Unknown=31, NotChecked=588, Total=2256 [2023-02-14 01:59:13,331 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 01:59:15,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:17,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:25,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:27,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:29,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:38,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:41,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:43,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:45,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:47,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:49,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:51,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:53,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:59:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:59:53,885 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2023-02-14 01:59:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 01:59:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-02-14 01:59:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:59:53,887 INFO L225 Difference]: With dead ends: 128 [2023-02-14 01:59:53,887 INFO L226 Difference]: Without dead ends: 128 [2023-02-14 01:59:53,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=373, Invalid=2700, Unknown=35, NotChecked=798, Total=3906 [2023-02-14 01:59:53,888 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 277 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 71 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:59:53,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 880 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1220 Invalid, 13 Unknown, 362 Unchecked, 27.5s Time] [2023-02-14 01:59:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-14 01:59:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2023-02-14 01:59:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.303030303030303) internal successors, (86), 80 states have internal predecessors, (86), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-14 01:59:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-02-14 01:59:53,892 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 38 [2023-02-14 01:59:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:59:53,892 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-02-14 01:59:53,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 01:59:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-02-14 01:59:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 01:59:53,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:59:53,893 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:59:53,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-14 01:59:54,095 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-14 01:59:54,293 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-14 01:59:54,293 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 01:59:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:59:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -316571989, now seen corresponding path program 1 times [2023-02-14 01:59:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:59:54,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277399911] [2023-02-14 01:59:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:59:54,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:59:54,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:59:54,295 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 01:59:54,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-14 01:59:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:59:54,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-14 01:59:54,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:59:54,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:54,463 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:59:54,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 01:59:54,490 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-14 01:59:54,495 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-14 01:59:56,524 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20|) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|))) is different from true [2023-02-14 01:59:58,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 01:59:58,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:00,730 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-14 02:00:00,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-14 02:00:00,734 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2023-02-14 02:00:00,936 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 02:00:00,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 45 [2023-02-14 02:00:00,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2023-02-14 02:00:01,068 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_448 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_448))))) is different from true [2023-02-14 02:00:01,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:01,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:01,088 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:01,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-14 02:00:01,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:03,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:03,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277399911] [2023-02-14 02:00:03,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277399911] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:03,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1029295836] [2023-02-14 02:00:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:03,415 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:03,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:00:03,416 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:00:03,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-14 02:00:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:03,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-14 02:00:03,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:03,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:03,739 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:03,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:03,847 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-14 02:00:03,856 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-14 02:00:04,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:04,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:04,438 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 02:00:04,438 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 55 treesize of output 41 [2023-02-14 02:00:04,442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53 [2023-02-14 02:00:04,836 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:00:04,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 45 [2023-02-14 02:00:04,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-14 02:00:04,860 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_483 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_483) |c_#length|)))) is different from true [2023-02-14 02:00:04,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:04,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:04,877 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:04,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 13 treesize of output 13 [2023-02-14 02:00:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 02:00:04,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:07,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1029295836] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:07,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:07,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2023-02-14 02:00:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134563191] [2023-02-14 02:00:07,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:07,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-14 02:00:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:07,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-14 02:00:07,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1437, Unknown=4, NotChecked=234, Total=1806 [2023-02-14 02:00:07,573 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 02:00:09,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:11,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:13,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-14 02:00:21,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:23,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:26,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:29,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:00:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:29,682 INFO L93 Difference]: Finished difference Result 189 states and 207 transitions. [2023-02-14 02:00:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 02:00:29,683 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2023-02-14 02:00:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:29,684 INFO L225 Difference]: With dead ends: 189 [2023-02-14 02:00:29,684 INFO L226 Difference]: Without dead ends: 189 [2023-02-14 02:00:29,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=306, Invalid=2672, Unknown=4, NotChecked=324, Total=3306 [2023-02-14 02:00:29,685 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 314 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 60 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 468 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:29,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1840 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2117 Invalid, 7 Unknown, 468 Unchecked, 16.7s Time] [2023-02-14 02:00:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-14 02:00:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 93. [2023-02-14 02:00:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 80 states have internal predecessors, (85), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-02-14 02:00:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2023-02-14 02:00:29,688 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2023-02-14 02:00:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:29,688 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2023-02-14 02:00:29,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 33 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-14 02:00:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2023-02-14 02:00:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 02:00:29,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:29,689 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-14 02:00:29,696 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 (29)] Ended with exit code 0 [2023-02-14 02:00:29,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-02-14 02:00:30,096 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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:30,097 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1161043861, now seen corresponding path program 1 times [2023-02-14 02:00:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:30,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218596798] [2023-02-14 02:00:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:30,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:30,098 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:30,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-14 02:00:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:30,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 02:00:30,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:00:30,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:30,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218596798] [2023-02-14 02:00:30,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218596798] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:30,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:30,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:00:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3894540] [2023-02-14 02:00:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:30,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:00:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:00:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:30,201 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:00:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:30,223 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-02-14 02:00:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:00:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-02-14 02:00:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:30,224 INFO L225 Difference]: With dead ends: 81 [2023-02-14 02:00:30,224 INFO L226 Difference]: Without dead ends: 79 [2023-02-14 02:00:30,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:30,225 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:30,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:00:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-14 02:00:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-02-14 02:00:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 66 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-14 02:00:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-02-14 02:00:30,228 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 38 [2023-02-14 02:00:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:30,228 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-02-14 02:00:30,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:00:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-02-14 02:00:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:00:30,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:30,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:30,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-02-14 02:00:30,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:30,436 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 717010680, now seen corresponding path program 1 times [2023-02-14 02:00:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:30,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345414699] [2023-02-14 02:00:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:30,438 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:30,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-14 02:00:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:30,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 02:00:30,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:30,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:30,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:30,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345414699] [2023-02-14 02:00:30,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345414699] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:30,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:30,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:00:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341645452] [2023-02-14 02:00:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:30,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:00:30,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:00:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:30,542 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 02:00:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:30,570 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2023-02-14 02:00:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:00:30,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-02-14 02:00:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:30,572 INFO L225 Difference]: With dead ends: 116 [2023-02-14 02:00:30,572 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 02:00:30,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:30,572 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:30,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 279 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:00:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 02:00:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2023-02-14 02:00:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.280701754385965) internal successors, (73), 69 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:00:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-02-14 02:00:30,575 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 40 [2023-02-14 02:00:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:30,575 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-02-14 02:00:30,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-14 02:00:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-02-14 02:00:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:00:30,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:30,576 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-14 02:00:30,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:30,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:30,783 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1835146281, now seen corresponding path program 1 times [2023-02-14 02:00:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:30,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496437553] [2023-02-14 02:00:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:30,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:30,785 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:30,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-14 02:00:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:30,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 02:00:30,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 02:00:30,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:30,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:30,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496437553] [2023-02-14 02:00:30,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496437553] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:30,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:30,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:00:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653274431] [2023-02-14 02:00:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:30,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:00:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:00:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:00:30,907 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:00:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:31,083 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2023-02-14 02:00:31,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:00:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-14 02:00:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:31,084 INFO L225 Difference]: With dead ends: 111 [2023-02-14 02:00:31,084 INFO L226 Difference]: Without dead ends: 111 [2023-02-14 02:00:31,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:00:31,084 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:31,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 317 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:00:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-14 02:00:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-02-14 02:00:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-14 02:00:31,086 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2023-02-14 02:00:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:31,087 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-14 02:00:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:00:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-14 02:00:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:00:31,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:31,087 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-14 02:00:31,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:31,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:31,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:31,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1835146280, now seen corresponding path program 1 times [2023-02-14 02:00:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:31,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328270776] [2023-02-14 02:00:31,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:31,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:31,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:31,290 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:31,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-14 02:00:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:31,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-14 02:00:31,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:31,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:31,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:31,478 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_563 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_563) |c_#length|)))) is different from true [2023-02-14 02:00:31,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:31,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:31,506 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:31,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:31,547 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_564 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_564))))) is different from true [2023-02-14 02:00:31,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:31,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:31,564 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:31,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2023-02-14 02:00:31,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:38,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:38,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328270776] [2023-02-14 02:00:38,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328270776] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:38,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [561767576] [2023-02-14 02:00:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:38,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:00:38,674 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:00:38,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-02-14 02:00:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:38,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 02:00:38,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:38,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:38,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:38,951 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:00:38,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 02:00:38,965 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:38,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:39,019 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_589 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_589))))) is different from true [2023-02-14 02:00:39,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:39,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:39,037 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:39,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-14 02:00:39,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:40,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [561767576] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:40,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:40,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 16 [2023-02-14 02:00:40,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375617822] [2023-02-14 02:00:40,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:40,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 02:00:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 02:00:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=332, Unknown=5, NotChecked=114, Total=506 [2023-02-14 02:00:40,500 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 02:00:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:41,273 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-02-14 02:00:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:00:41,274 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2023-02-14 02:00:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:41,274 INFO L225 Difference]: With dead ends: 121 [2023-02-14 02:00:41,274 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 02:00:41,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=89, Invalid=518, Unknown=5, NotChecked=144, Total=756 [2023-02-14 02:00:41,275 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 98 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 10 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:41,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 806 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 565 Invalid, 10 Unknown, 351 Unchecked, 0.6s Time] [2023-02-14 02:00:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 02:00:41,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2023-02-14 02:00:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-14 02:00:41,278 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 40 [2023-02-14 02:00:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:41,278 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-14 02:00:41,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-14 02:00:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-14 02:00:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 02:00:41,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:41,279 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:41,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:41,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-02-14 02:00:41,686 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,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:41,686 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 752121782, now seen corresponding path program 1 times [2023-02-14 02:00:41,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:41,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602567090] [2023-02-14 02:00:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:41,688 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:41,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-14 02:00:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:41,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 02:00:41,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:41,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:41,818 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-14 02:00:41,829 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 02:00:41,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:00:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 02:00:41,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:41,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:41,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602567090] [2023-02-14 02:00:41,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602567090] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:41,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:41,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:00:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363125986] [2023-02-14 02:00:41,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:41,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:00:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:41,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:00:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-02-14 02:00:41,855 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:00:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:41,973 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-02-14 02:00:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:00:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-02-14 02:00:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:41,974 INFO L225 Difference]: With dead ends: 94 [2023-02-14 02:00:41,974 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 02:00:41,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-02-14 02:00:41,974 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:41,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 197 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2023-02-14 02:00:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 02:00:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2023-02-14 02:00:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 74 states have internal predecessors, (77), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-02-14 02:00:41,983 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 41 [2023-02-14 02:00:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:41,983 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-02-14 02:00:41,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:00:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-02-14 02:00:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 02:00:41,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:41,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00: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 (36)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:42,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:42,189 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 752121783, now seen corresponding path program 1 times [2023-02-14 02:00:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:42,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630737891] [2023-02-14 02:00:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:42,191 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:42,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-14 02:00:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:42,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 02:00:42,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:42,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:42,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:42,423 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_649 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_649))))) is different from true [2023-02-14 02:00:42,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:42,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:42,442 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:42,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:42,493 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_650 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_650) |c_#length|)))) is different from true [2023-02-14 02:00:42,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:42,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:42,513 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:42,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:42,598 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_651 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_651) |c_#length|)))) is different from true [2023-02-14 02:00:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:42,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:42,619 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:42,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2023-02-14 02:00:42,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:43,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630737891] [2023-02-14 02:00:43,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630737891] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1365562810] [2023-02-14 02:00:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:43,035 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:00:43,036 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:00:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-02-14 02:00:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:43,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 02:00:43,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:43,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:43,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:00:43,322 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:00:43,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 02:00:43,335 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:43,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:43,390 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_684 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_684) |c_#length|)))) is different from true [2023-02-14 02:00:43,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:43,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:43,417 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:43,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:43,462 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_685 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_685))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-14 02:00:43,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:43,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:00:43,485 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:00:43,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:00:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 10 not checked. [2023-02-14 02:00:43,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:43,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1365562810] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:43,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:43,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2023-02-14 02:00:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603591035] [2023-02-14 02:00:43,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:43,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 02:00:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 02:00:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=270, Unknown=5, NotChecked=180, Total=506 [2023-02-14 02:00:43,670 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-14 02:00:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:44,376 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2023-02-14 02:00:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 02:00:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2023-02-14 02:00:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:44,383 INFO L225 Difference]: With dead ends: 126 [2023-02-14 02:00:44,383 INFO L226 Difference]: Without dead ends: 126 [2023-02-14 02:00:44,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=481, Unknown=5, NotChecked=240, Total=812 [2023-02-14 02:00:44,384 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 128 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 13 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 505 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:44,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 665 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 500 Invalid, 12 Unknown, 505 Unchecked, 0.5s Time] [2023-02-14 02:00:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-14 02:00:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2023-02-14 02:00:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 73 states have internal predecessors, (76), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2023-02-14 02:00:44,387 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 41 [2023-02-14 02:00:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:44,387 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2023-02-14 02:00:44,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (5), 3 states have call predecessors, (5), 7 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-14 02:00:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2023-02-14 02:00:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 02:00:44,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:44,388 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-14 02:00:44,397 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 (37)] Ended with exit code 0 [2023-02-14 02:00:44,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:44,797 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,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:44,797 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:44,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1833421355, now seen corresponding path program 1 times [2023-02-14 02:00:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:44,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796340935] [2023-02-14 02:00:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:44,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:44,799 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:44,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-14 02:00:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:44,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 02:00:44,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:00:45,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:45,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:00:45,451 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 24 treesize of output 28 [2023-02-14 02:00:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:45,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796340935] [2023-02-14 02:00:45,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796340935] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:00:45,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:45,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-14 02:00:45,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345215848] [2023-02-14 02:00:45,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:45,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 02:00:45,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:45,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 02:00:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-02-14 02:00:45,779 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-14 02:00:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:46,361 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-02-14 02:00:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:00:46,362 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 46 [2023-02-14 02:00:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:46,362 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:00:46,362 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:00:46,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-02-14 02:00:46,363 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 237 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:46,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 413 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 02:00:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:00:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-14 02:00:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 72 states have internal predecessors, (75), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-02-14 02:00:46,367 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 46 [2023-02-14 02:00:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:46,367 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-02-14 02:00:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-14 02:00:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-02-14 02:00:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 02:00:46,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:46,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-14 02:00:46,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:46,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:46,568 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1833421356, now seen corresponding path program 1 times [2023-02-14 02:00:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:46,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305942627] [2023-02-14 02:00:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:46,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:46,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:46,570 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:46,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-14 02:00:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:46,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 02:00:46,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 02:00:46,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:46,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:46,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305942627] [2023-02-14 02:00:46,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305942627] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:46,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:46,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:00:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883455587] [2023-02-14 02:00:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:46,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:00:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:46,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:00:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:00:46,722 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:46,925 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-14 02:00:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 02:00:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2023-02-14 02:00:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:46,926 INFO L225 Difference]: With dead ends: 112 [2023-02-14 02:00:46,926 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 02:00:46,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-14 02:00:46,926 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 131 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:46,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 188 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:00:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 02:00:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2023-02-14 02:00:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-14 02:00:46,928 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 46 [2023-02-14 02:00:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:46,930 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-14 02:00:46,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-14 02:00:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-14 02:00:46,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:46,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:46,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:47,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:47,131 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:47,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1963012722, now seen corresponding path program 1 times [2023-02-14 02:00:47,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:47,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846632019] [2023-02-14 02:00:47,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:47,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:47,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:47,136 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:47,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-14 02:00:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:47,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 02:00:47,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-14 02:00:47,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:47,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846632019] [2023-02-14 02:00:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846632019] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:47,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:47,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:00:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217161901] [2023-02-14 02:00:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:47,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:00:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:00:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:00:47,283 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:47,409 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-02-14 02:00:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:00:47,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2023-02-14 02:00:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:47,410 INFO L225 Difference]: With dead ends: 94 [2023-02-14 02:00:47,410 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 02:00:47,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:00:47,410 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 82 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:47,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 230 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:00:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 02:00:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2023-02-14 02:00:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 71 states have internal predecessors, (74), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-14 02:00:47,412 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 47 [2023-02-14 02:00:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:47,413 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-14 02:00:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-14 02:00:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 02:00:47,413 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:47,413 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-14 02:00:47,421 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-14 02:00:47,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:47,621 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1021505201, now seen corresponding path program 1 times [2023-02-14 02:00:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:47,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283949299] [2023-02-14 02:00:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:47,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:47,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:47,623 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:47,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-14 02:00:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:47,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-14 02:00:47,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:47,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:00:47,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:00:47,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 15 treesize of output 7 [2023-02-14 02:00:47,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:00:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:48,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:48,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2023-02-14 02:00:48,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:48,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:48,482 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 30 treesize of output 24 [2023-02-14 02:00:48,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:48,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:00:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-14 02:00:48,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283949299] [2023-02-14 02:00:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283949299] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:48,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:00:48,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 19 [2023-02-14 02:00:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610948067] [2023-02-14 02:00:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:48,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:00:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:00:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-02-14 02:00:48,581 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:49,101 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2023-02-14 02:00:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:00:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-02-14 02:00:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:49,102 INFO L225 Difference]: With dead ends: 126 [2023-02-14 02:00:49,102 INFO L226 Difference]: Without dead ends: 126 [2023-02-14 02:00:49,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-02-14 02:00:49,103 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 155 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:49,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 569 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:00:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-14 02:00:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2023-02-14 02:00:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 77 states have internal predecessors, (80), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-02-14 02:00:49,106 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 51 [2023-02-14 02:00:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:49,106 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-02-14 02:00:49,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-02-14 02:00:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:00:49,106 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:49,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:49,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:49,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:49,307 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:49,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1703598893, now seen corresponding path program 1 times [2023-02-14 02:00:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:49,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846215043] [2023-02-14 02:00:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:49,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:49,309 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:49,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-02-14 02:00:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:49,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-14 02:00:49,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:49,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:00:49,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:00:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-14 02:00:49,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:49,857 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 30 treesize of output 24 [2023-02-14 02:00:49,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-02-14 02:00:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:50,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:50,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846215043] [2023-02-14 02:00:50,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846215043] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:50,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:00:50,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 22 [2023-02-14 02:00:50,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135192892] [2023-02-14 02:00:50,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:50,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 02:00:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 02:00:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:00:50,086 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 02:00:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:50,567 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2023-02-14 02:00:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 02:00:50,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2023-02-14 02:00:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:50,568 INFO L225 Difference]: With dead ends: 89 [2023-02-14 02:00:50,568 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 02:00:50,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2023-02-14 02:00:50,569 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 199 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:50,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 410 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:00:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 02:00:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-14 02:00:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.161764705882353) internal successors, (79), 76 states have internal predecessors, (79), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-02-14 02:00:50,571 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 52 [2023-02-14 02:00:50,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:50,571 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-02-14 02:00:50,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 02:00:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-02-14 02:00:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:00:50,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:50,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-14 02:00:50,583 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 (43)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:50,773 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1601898209, now seen corresponding path program 1 times [2023-02-14 02:00:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810463423] [2023-02-14 02:00:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:50,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:50,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:50,774 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-02-14 02:00:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:50,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 02:00:50,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:50,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:50,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810463423] [2023-02-14 02:00:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810463423] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:00:50,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:50,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-14 02:00:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350581503] [2023-02-14 02:00:50,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:00:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:00:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:50,962 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:50,985 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2023-02-14 02:00:50,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:00:50,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-02-14 02:00:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:50,986 INFO L225 Difference]: With dead ends: 88 [2023-02-14 02:00:50,986 INFO L226 Difference]: Without dead ends: 88 [2023-02-14 02:00:50,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:50,987 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:50,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 209 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:00:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-14 02:00:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-14 02:00:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 75 states have internal predecessors, (78), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2023-02-14 02:00:50,989 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 52 [2023-02-14 02:00:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:50,989 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2023-02-14 02:00:50,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2023-02-14 02:00:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 02:00:50,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:50,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:51,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:51,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:51,202 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1271958025, now seen corresponding path program 1 times [2023-02-14 02:00:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:51,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394307287] [2023-02-14 02:00:51,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:51,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:51,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:51,204 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:51,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-02-14 02:00:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:51,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 02:00:51,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:51,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:00:51,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:00:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:00:52,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:52,517 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 30 treesize of output 24 [2023-02-14 02:00:52,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2023-02-14 02:00:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:52,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:52,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394307287] [2023-02-14 02:00:52,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394307287] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:52,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:00:52,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 30 [2023-02-14 02:00:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114631893] [2023-02-14 02:00:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:52,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 02:00:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 02:00:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2023-02-14 02:00:52,894 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 02:00:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:53,965 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2023-02-14 02:00:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 02:00:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2023-02-14 02:00:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:53,966 INFO L225 Difference]: With dead ends: 133 [2023-02-14 02:00:53,966 INFO L226 Difference]: Without dead ends: 133 [2023-02-14 02:00:53,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2023-02-14 02:00:53,967 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 203 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:53,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 463 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 02:00:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-14 02:00:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2023-02-14 02:00:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 83 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-02-14 02:00:53,980 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 53 [2023-02-14 02:00:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:53,980 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-02-14 02:00:53,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-14 02:00:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-02-14 02:00:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 02:00:53,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:53,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-14 02:00:54,003 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-14 02:00:54,189 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 [2023-02-14 02:00:54,190 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1880762957, now seen corresponding path program 1 times [2023-02-14 02:00:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:54,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255707124] [2023-02-14 02:00:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:54,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:54,192 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:54,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-02-14 02:00:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:54,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 02:00:54,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 02:00:54,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:54,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:54,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255707124] [2023-02-14 02:00:54,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255707124] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:00:54,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:54,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-14 02:00:54,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410873725] [2023-02-14 02:00:54,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:54,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 02:00:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 02:00:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:00:54,772 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-14 02:00:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:55,002 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-02-14 02:00:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:00:55,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 53 [2023-02-14 02:00:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:55,003 INFO L225 Difference]: With dead ends: 98 [2023-02-14 02:00:55,003 INFO L226 Difference]: Without dead ends: 98 [2023-02-14 02:00:55,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:00:55,004 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:55,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 244 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:00:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-14 02:00:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-02-14 02:00:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.12987012987013) internal successors, (87), 82 states have internal predecessors, (87), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-14 02:00:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-02-14 02:00:55,006 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 53 [2023-02-14 02:00:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:55,006 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-02-14 02:00:55,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-14 02:00:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-02-14 02:00:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 02:00:55,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:55,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-14 02:00:55,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:55,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:55,209 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1060607112, now seen corresponding path program 1 times [2023-02-14 02:00:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:55,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234661376] [2023-02-14 02:00:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:55,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:55,211 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-14 02:00:55,212 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-14 02:00:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:55,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 02:00:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-14 02:00:55,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:00:55,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:55,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234661376] [2023-02-14 02:00:55,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234661376] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:00:55,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:00:55,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:00:55,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783004985] [2023-02-14 02:00:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:00:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:00:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:00:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:55,350 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:55,367 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-14 02:00:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:00:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2023-02-14 02:00:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:55,368 INFO L225 Difference]: With dead ends: 100 [2023-02-14 02:00:55,369 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 02:00:55,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:00:55,369 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:55,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 321 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:00:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 02:00:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2023-02-14 02:00:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:00:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2023-02-14 02:00:55,371 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 53 [2023-02-14 02:00:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:55,372 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2023-02-14 02:00:55,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-14 02:00:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2023-02-14 02:00:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 02:00:55,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:55,373 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:55,383 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 (47)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:55,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:55,581 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash -775993003, now seen corresponding path program 1 times [2023-02-14 02:00:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:55,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62480940] [2023-02-14 02:00:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:55,582 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:55,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-02-14 02:00:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:55,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-14 02:00:55,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:55,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:55,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:00:55,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-14 02:00:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 02:00:56,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:56,229 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 38 treesize of output 32 [2023-02-14 02:00:56,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62480940] [2023-02-14 02:00:56,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62480940] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1307245256] [2023-02-14 02:00:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:56,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:56,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:00:56,288 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:00:56,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-02-14 02:00:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:56,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-14 02:00:56,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:56,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:56,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:00:56,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-14 02:00:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 02:00:56,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:56,813 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 38 treesize of output 32 [2023-02-14 02:00:56,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1307245256] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:00:56,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:56,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2023-02-14 02:00:56,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318066920] [2023-02-14 02:00:56,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 02:00:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 02:00:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-02-14 02:00:56,862 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-14 02:00:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:57,738 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2023-02-14 02:00:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 02:00:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2023-02-14 02:00:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:57,739 INFO L225 Difference]: With dead ends: 93 [2023-02-14 02:00:57,739 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 02:00:57,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2023-02-14 02:00:57,739 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 163 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:57,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 326 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 02:00:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 02:00:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2023-02-14 02:00:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 70 states have internal predecessors, (73), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:00:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2023-02-14 02:00:57,741 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 54 [2023-02-14 02:00:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:57,742 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2023-02-14 02:00:57,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-14 02:00:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2023-02-14 02:00:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 02:00:57,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:57,742 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-02-14 02:00:57,750 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 (48)] Ended with exit code 0 [2023-02-14 02:00:57,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:58,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:00:58,150 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1825890595, now seen corresponding path program 1 times [2023-02-14 02:00:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:58,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976908173] [2023-02-14 02:00:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:58,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:58,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:58,152 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:00:58,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-02-14 02:00:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:58,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 02:00:58,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:58,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:00:58,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:00:58,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:58,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976908173] [2023-02-14 02:00:58,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976908173] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:00:58,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:58,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-14 02:00:58,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488846495] [2023-02-14 02:00:58,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:58,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 02:00:58,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 02:00:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:00:58,437 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 02:00:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:58,620 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-02-14 02:00:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:00:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-02-14 02:00:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:58,621 INFO L225 Difference]: With dead ends: 87 [2023-02-14 02:00:58,621 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 02:00:58,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:00:58,622 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:58,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 150 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:00:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 02:00:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-14 02:00:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 74 states have internal predecessors, (77), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:00:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2023-02-14 02:00:58,624 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 54 [2023-02-14 02:00:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:58,624 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2023-02-14 02:00:58,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-14 02:00:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2023-02-14 02:00:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 02:00:58,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:58,625 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-14 02:00:58,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2023-02-14 02:00:58,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:58,837 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash -653967976, now seen corresponding path program 1 times [2023-02-14 02:00:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:58,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021719821] [2023-02-14 02:00:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:58,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:58,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:58,839 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-14 02:00:58,841 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-14 02:00:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:00:58,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 02:00:58,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:00:58,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:00:59,043 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:00:59,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:00:59,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:00:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 02:00:59,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:00:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 02:00:59,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:00:59,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021719821] [2023-02-14 02:00:59,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021719821] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:00:59,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:00:59,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-02-14 02:00:59,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800077632] [2023-02-14 02:00:59,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:00:59,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 02:00:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:00:59,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 02:00:59,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-14 02:00:59,388 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-14 02:00:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:00:59,728 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2023-02-14 02:00:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 02:00:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2023-02-14 02:00:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:00:59,729 INFO L225 Difference]: With dead ends: 90 [2023-02-14 02:00:59,729 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 02:00:59,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-02-14 02:00:59,730 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:00:59,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:00:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 02:00:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-14 02:00:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 77 states have internal predecessors, (80), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:00:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2023-02-14 02:00:59,732 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 57 [2023-02-14 02:00:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:00:59,732 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2023-02-14 02:00:59,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2023-02-14 02:00:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2023-02-14 02:00:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 02:00:59,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:00:59,732 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:00:59,740 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-14 02:00:59,936 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-14 02:00:59,937 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:00:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:00:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -472565031, now seen corresponding path program 1 times [2023-02-14 02:00:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:00:59,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647910225] [2023-02-14 02:00:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:00:59,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:00:59,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:00:59,938 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-14 02:00:59,939 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-14 02:01:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:00,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-14 02:01:00,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:00,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:00,288 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:01:00,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:01:00,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:01:00,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 02:01:00,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 02:01:00,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:01,079 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 26 [2023-02-14 02:01:01,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2023-02-14 02:01:01,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:01:01,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647910225] [2023-02-14 02:01:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647910225] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:01:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1523175645] [2023-02-14 02:01:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:01:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:01:01,596 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:01:01,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-02-14 02:01:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:01,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-14 02:01:01,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:01,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:02,028 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:01:02,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:01:02,120 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-14 02:01:02,127 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-14 02:01:04,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 7 [2023-02-14 02:01:04,523 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 02:01:04,524 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 42 treesize of output 32 [2023-02-14 02:01:04,527 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 33 treesize of output 33 [2023-02-14 02:01:04,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2023-02-14 02:01:04,905 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-14 02:01:04,905 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 20 [2023-02-14 02:01:05,107 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:01:05,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:01:05,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:01:05,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 02:01:05,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:01:05,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:05,536 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 26 [2023-02-14 02:01:05,568 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 70 treesize of output 58 [2023-02-14 02:01:05,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:01:05,640 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 27 treesize of output 33 [2023-02-14 02:01:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1523175645] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:01:05,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:01:05,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 33] total 42 [2023-02-14 02:01:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045255094] [2023-02-14 02:01:05,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:01:05,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-14 02:01:05,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:01:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-14 02:01:05,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2516, Unknown=3, NotChecked=0, Total=2756 [2023-02-14 02:01:05,925 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 43 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-14 02:01:12,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:14,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:21,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:24,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:26,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:28,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:31,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:33,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:35,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 02:01:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:01:35,163 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2023-02-14 02:01:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 02:01:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 58 [2023-02-14 02:01:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:01:35,164 INFO L225 Difference]: With dead ends: 103 [2023-02-14 02:01:35,164 INFO L226 Difference]: Without dead ends: 103 [2023-02-14 02:01:35,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=758, Invalid=6208, Unknown=6, NotChecked=0, Total=6972 [2023-02-14 02:01:35,165 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 340 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 57 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:01:35,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 299 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1117 Invalid, 9 Unknown, 0 Unchecked, 19.2s Time] [2023-02-14 02:01:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-14 02:01:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2023-02-14 02:01:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 76 states have internal predecessors, (79), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:01:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2023-02-14 02:01:35,168 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 58 [2023-02-14 02:01:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:01:35,168 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2023-02-14 02:01:35,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.775) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-14 02:01:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2023-02-14 02:01:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-14 02:01:35,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:01:35,169 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:01:35,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:35,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Ended with exit code 0 [2023-02-14 02:01:35,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:35,574 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:01:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:01:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash -388191190, now seen corresponding path program 1 times [2023-02-14 02:01:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:01:35,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491736836] [2023-02-14 02:01:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:01:35,576 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:01:35,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2023-02-14 02:01:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:35,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 02:01:35,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:35,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:35,795 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:01:35,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:01:35,864 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:01:35,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:01:36,060 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 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:36,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:01:36,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:36,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:01:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491736836] [2023-02-14 02:01:36,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491736836] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:01:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [885352702] [2023-02-14 02:01:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:36,343 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:01:36,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:01:36,344 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:01:36,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2023-02-14 02:01:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:36,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-14 02:01:36,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:36,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:36,603 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:01:36,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:01:36,658 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:01:36,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:01:36,895 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 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:36,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:01:36,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:37,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:01:37,129 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 25 treesize of output 31 [2023-02-14 02:01:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [885352702] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:01:37,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:01:37,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2023-02-14 02:01:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179383041] [2023-02-14 02:01:37,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:01:37,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 02:01:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:01:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 02:01:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-02-14 02:01:37,177 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-14 02:01:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:01:37,504 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-02-14 02:01:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 02:01:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 60 [2023-02-14 02:01:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:01:37,505 INFO L225 Difference]: With dead ends: 92 [2023-02-14 02:01:37,505 INFO L226 Difference]: Without dead ends: 92 [2023-02-14 02:01:37,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 168 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:01:37,505 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:01:37,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 225 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:01:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-14 02:01:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-14 02:01:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:01:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2023-02-14 02:01:37,507 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 60 [2023-02-14 02:01:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:01:37,508 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2023-02-14 02:01:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.388888888888889) internal successors, (61), 14 states have internal predecessors, (61), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-14 02:01:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2023-02-14 02:01:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 02:01:37,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:01:37,509 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:01:37,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:37,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:37,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:01:37,914 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:01:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:01:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 718077986, now seen corresponding path program 1 times [2023-02-14 02:01:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:01:37,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541992479] [2023-02-14 02:01:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:01:37,915 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:01:37,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2023-02-14 02:01:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:38,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-14 02:01:38,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:38,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:38,170 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:01:38,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:01:38,332 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:01:38,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:01:38,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:01:38,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 02:01:38,816 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 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:38,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 02:01:38,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:39,300 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 26 [2023-02-14 02:01:39,408 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 70 treesize of output 58 [2023-02-14 02:01:39,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 02:01:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541992479] [2023-02-14 02:01:39,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541992479] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:01:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981484227] [2023-02-14 02:01:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 02:01:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 02:01:39,860 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 02:01:39,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-02-14 02:01:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:40,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-14 02:01:40,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:40,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-14 02:01:40,264 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 02:01:40,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-14 02:01:40,421 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-14 02:01:40,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-14 02:01:40,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 13 treesize of output 9 [2023-02-14 02:01:40,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 02:01:40,592 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 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:40,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-14 02:01:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 02:01:40,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:01:40,912 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 26 [2023-02-14 02:01:40,938 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 70 treesize of output 58 [2023-02-14 02:01:41,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1981484227] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:01:41,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:01:41,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 28 [2023-02-14 02:01:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91805754] [2023-02-14 02:01:41,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:01:41,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 02:01:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 02:01:41,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 02:01:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1095, Unknown=1, NotChecked=0, Total=1260 [2023-02-14 02:01:41,165 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 02:01:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:01:42,489 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2023-02-14 02:01:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-14 02:01:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2023-02-14 02:01:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:01:42,490 INFO L225 Difference]: With dead ends: 98 [2023-02-14 02:01:42,490 INFO L226 Difference]: Without dead ends: 98 [2023-02-14 02:01:42,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 132 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=339, Invalid=2012, Unknown=1, NotChecked=0, Total=2352 [2023-02-14 02:01:42,491 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 135 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 02:01:42,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 298 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-14 02:01:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-14 02:01:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-02-14 02:01:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.051948051948052) internal successors, (81), 78 states have internal predecessors, (81), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-14 02:01:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2023-02-14 02:01:42,493 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 61 [2023-02-14 02:01:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:01:42,494 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2023-02-14 02:01:42,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 23 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 02:01:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2023-02-14 02:01:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-14 02:01:42,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:01:42,495 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:01:42,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Forceful destruction successful, exit code 0 [2023-02-14 02:01:42,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Ended with exit code 0 [2023-02-14 02:01:42,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 02:01:42,906 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-14 02:01:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:01:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash 610425485, now seen corresponding path program 1 times [2023-02-14 02:01:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 02:01:42,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488342350] [2023-02-14 02:01:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:01:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 02:01:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 02:01:42,908 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 02:01:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2023-02-14 02:01:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:01:43,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 02:01:43,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:01:43,619 INFO L321 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2023-02-14 02:01:43,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 168 [2023-02-14 02:01:59,520 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_1361 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~cfg~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~fe~1#1.base| (_ BitVec 32)) (v_ArrVal_1355 (_ BitVec 1))) (let ((.cse3 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_1355))) (let ((.cse0 (store .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_1361))) (let ((.cse1 (store .cse0 |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 1)))) (let ((.cse2 (store .cse1 |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 1)))) (and (= (select .cse0 |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))) (= (store .cse2 |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (bvadd (select .cse2 |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32))) (= (_ bv0 1) (select .cse3 |ULTIMATE.start_entry_point_~cfg~1#1.base|)))))))) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 1)))) is different from true [2023-02-14 02:01:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 02:01:59,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:02:00,051 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 18 treesize of output 16 [2023-02-14 02:02:00,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16