./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 21:25:05,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 21:25:05,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 21:25:06,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 21:25:06,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 21:25:06,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 21:25:06,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 21:25:06,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 21:25:06,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 21:25:06,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 21:25:06,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 21:25:06,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 21:25:06,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 21:25:06,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 21:25:06,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 21:25:06,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 21:25:06,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 21:25:06,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 21:25:06,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 21:25:06,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 21:25:06,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 21:25:06,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 21:25:06,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 21:25:06,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 21:25:06,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 21:25:06,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 21:25:06,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 21:25:06,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 21:25:06,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 21:25:06,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 21:25:06,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 21:25:06,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 21:25:06,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 21:25:06,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 21:25:06,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 21:25:06,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 21:25:06,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 21:25:06,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 21:25:06,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 21:25:06,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 21:25:06,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 21:25:06,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 21:25:06,073 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 21:25:06,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 21:25:06,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 21:25:06,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 21:25:06,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 21:25:06,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 21:25:06,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 21:25:06,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 21:25:06,076 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 21:25:06,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 21:25:06,076 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 21:25:06,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 21:25:06,078 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 21:25:06,078 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 21:25:06,078 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 21:25:06,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 21:25:06,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 21:25:06,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 21:25:06,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:25:06,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 21:25:06,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 21:25:06,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 21:25:06,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 21:25:06,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 21:25:06,079 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 21:25:06,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 21:25:06,080 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 21:25:06,080 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 -> 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 [2023-02-18 21:25:06,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 21:25:06,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 21:25:06,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 21:25:06,246 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 21:25:06,246 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 21:25:06,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-18 21:25:07,143 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 21:25:07,404 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 21:25:07,404 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-18 21:25:07,413 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca3ad45d/e06297fa0a2d4bd89e17744ed7062d63/FLAG6b6d791f0 [2023-02-18 21:25:07,424 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca3ad45d/e06297fa0a2d4bd89e17744ed7062d63 [2023-02-18 21:25:07,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 21:25:07,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 21:25:07,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 21:25:07,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 21:25:07,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 21:25:07,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:25:07" (1/1) ... [2023-02-18 21:25:07,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3598e322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:07, skipping insertion in model container [2023-02-18 21:25:07,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:25:07" (1/1) ... [2023-02-18 21:25:07,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 21:25:07,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:25:07,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:25:07,734 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-18 21:25:07,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fc023ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:07, skipping insertion in model container [2023-02-18 21:25:07,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 21:25:07,736 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-18 21:25:07,738 INFO L158 Benchmark]: Toolchain (without parser) took 309.67ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 113.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 21:25:07,738 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 21:25:07,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.22ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 113.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 21:25:07,740 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.16ms. Allocated memory is still 109.1MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.22ms. Allocated memory is still 165.7MB. Free memory was 127.1MB in the beginning and 113.5MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 21:25:09,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 21:25:09,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 21:25:09,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 21:25:09,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 21:25:09,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 21:25:09,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 21:25:09,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 21:25:09,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 21:25:09,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 21:25:09,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 21:25:09,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 21:25:09,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 21:25:09,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 21:25:09,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 21:25:09,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 21:25:09,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 21:25:09,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 21:25:09,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 21:25:09,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 21:25:09,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 21:25:09,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 21:25:09,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 21:25:09,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 21:25:09,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 21:25:09,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 21:25:09,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 21:25:09,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 21:25:09,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 21:25:09,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 21:25:09,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 21:25:09,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 21:25:09,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 21:25:09,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 21:25:09,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 21:25:09,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 21:25:09,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 21:25:09,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 21:25:09,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 21:25:09,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 21:25:09,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 21:25:09,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-18 21:25:09,238 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 21:25:09,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 21:25:09,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 21:25:09,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 21:25:09,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 21:25:09,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 21:25:09,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 21:25:09,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 21:25:09,241 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 21:25:09,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 21:25:09,241 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 21:25:09,241 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 21:25:09,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 21:25:09,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 21:25:09,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 21:25:09,242 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 21:25:09,242 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 21:25:09,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 21:25:09,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 21:25:09,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 21:25:09,243 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 21:25:09,243 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 21:25:09,243 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 21:25:09,243 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 21:25:09,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 21:25:09,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 21:25:09,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 21:25:09,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:25:09,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 21:25:09,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 21:25:09,244 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 21:25:09,245 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 21:25:09,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 21:25:09,245 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 21:25:09,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 21:25:09,245 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 21:25:09,245 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 21:25:09,246 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 -> 7f731faf9d41ed60f5858e3dbd50ffba002d2a56a92297f4715b69207f896c11 [2023-02-18 21:25:09,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 21:25:09,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 21:25:09,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 21:25:09,480 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 21:25:09,481 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 21:25:09,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-18 21:25:10,496 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 21:25:10,722 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 21:25:10,723 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2023-02-18 21:25:10,732 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ece877e2/963584ab2de6407392f56b6bdd0096bb/FLAGc24797de9 [2023-02-18 21:25:10,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ece877e2/963584ab2de6407392f56b6bdd0096bb [2023-02-18 21:25:10,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 21:25:10,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 21:25:10,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 21:25:10,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 21:25:10,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 21:25:10,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:25:10" (1/1) ... [2023-02-18 21:25:10,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61153caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:10, skipping insertion in model container [2023-02-18 21:25:10,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:25:10" (1/1) ... [2023-02-18 21:25:10,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 21:25:10,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:25:10,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:25:10,992 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-18 21:25:11,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:25:11,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:25:11,035 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 21:25:11,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:25:11,104 INFO L208 MainTranslator]: Completed translation [2023-02-18 21:25:11,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11 WrapperNode [2023-02-18 21:25:11,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 21:25:11,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 21:25:11,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 21:25:11,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 21:25:11,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,160 INFO L138 Inliner]: procedures = 169, calls = 80, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 65 [2023-02-18 21:25:11,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 21:25:11,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 21:25:11,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 21:25:11,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 21:25:11,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,199 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 21:25:11,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 21:25:11,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 21:25:11,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 21:25:11,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (1/1) ... [2023-02-18 21:25:11,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:25:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:25:11,237 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-18 21:25:11,264 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-18 21:25:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-18 21:25:11,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-18 21:25:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 21:25:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 21:25:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 21:25:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 21:25:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 21:25:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-18 21:25:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 21:25:11,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 21:25:11,401 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 21:25:11,403 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 21:25:11,545 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 21:25:11,549 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 21:25:11,549 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 21:25:11,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:11 BoogieIcfgContainer [2023-02-18 21:25:11,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 21:25:11,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 21:25:11,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 21:25:11,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 21:25:11,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 09:25:10" (1/3) ... [2023-02-18 21:25:11,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b55cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:25:11, skipping insertion in model container [2023-02-18 21:25:11,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:25:11" (2/3) ... [2023-02-18 21:25:11,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b55cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:25:11, skipping insertion in model container [2023-02-18 21:25:11,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:11" (3/3) ... [2023-02-18 21:25:11,556 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2023-02-18 21:25:11,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 21:25:11,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-18 21:25:11,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 21:25:11,597 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;@6408944e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 21:25:11,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-18 21:25:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 45 states have internal predecessors, (50), 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-18 21:25:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:25:11,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:11,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:11,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash 566157246, now seen corresponding path program 1 times [2023-02-18 21:25:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110044379] [2023-02-18 21:25:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:11,617 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-18 21:25:11,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:11,620 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-18 21:25:11,621 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-18 21:25:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:11,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:25:11,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:11,777 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-18 21:25:11,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:11,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:11,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110044379] [2023-02-18 21:25:11,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110044379] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:11,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:11,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915372048] [2023-02-18 21:25:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:11,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:11,814 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 45 states have internal predecessors, (50), 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) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-18 21:25:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:11,871 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-18 21:25:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:11,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2023-02-18 21:25:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:11,877 INFO L225 Difference]: With dead ends: 89 [2023-02-18 21:25:11,877 INFO L226 Difference]: Without dead ends: 85 [2023-02-18 21:25:11,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-18 21:25:11,881 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:11,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 218 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-18 21:25:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2023-02-18 21:25:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 46 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-18 21:25:11,902 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2023-02-18 21:25:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:11,903 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-18 21:25:11,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-18 21:25:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-18 21:25:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:25:11,903 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:11,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:11,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:12,112 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-18 21:25:12,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash 566187056, now seen corresponding path program 1 times [2023-02-18 21:25:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:12,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618468724] [2023-02-18 21:25:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:12,114 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-18 21:25:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:12,120 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-18 21:25:12,121 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-18 21:25:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:12,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:25:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:12,186 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-18 21:25:12,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:12,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:12,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618468724] [2023-02-18 21:25:12,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618468724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:12,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:12,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:25:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803164582] [2023-02-18 21:25:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:12,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:12,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:12,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:12,193 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-18 21:25:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:12,223 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2023-02-18 21:25:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:12,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2023-02-18 21:25:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:12,224 INFO L225 Difference]: With dead ends: 48 [2023-02-18 21:25:12,224 INFO L226 Difference]: Without dead ends: 48 [2023-02-18 21:25:12,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-18 21:25:12,225 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:12,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-18 21:25:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-18 21:25:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 44 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-18 21:25:12,229 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2023-02-18 21:25:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:12,230 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-18 21:25:12,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-18 21:25:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-18 21:25:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:25:12,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:12,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:12,259 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-18 21:25:12,457 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-18 21:25:12,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1985999715, now seen corresponding path program 1 times [2023-02-18 21:25:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:12,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199072338] [2023-02-18 21:25:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:12,458 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-18 21:25:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:12,460 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-18 21:25:12,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 21:25:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:12,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:25:12,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:12,527 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-18 21:25:12,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:12,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:12,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199072338] [2023-02-18 21:25:12,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199072338] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:12,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:12,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060608953] [2023-02-18 21:25:12,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:12,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:12,531 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-18 21:25:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:12,561 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2023-02-18 21:25:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:12,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2023-02-18 21:25:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:12,562 INFO L225 Difference]: With dead ends: 56 [2023-02-18 21:25:12,562 INFO L226 Difference]: Without dead ends: 56 [2023-02-18 21:25:12,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 21:25:12,565 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:12,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 167 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-18 21:25:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2023-02-18 21:25:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-18 21:25:12,574 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 12 [2023-02-18 21:25:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:12,575 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-18 21:25:12,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-18 21:25:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-18 21:25:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:25:12,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:12,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:12,588 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-18 21:25:12,778 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-18 21:25:12,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1985999298, now seen corresponding path program 1 times [2023-02-18 21:25:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:12,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286241737] [2023-02-18 21:25:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:12,780 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-18 21:25:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:12,781 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-18 21:25:12,783 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-18 21:25:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:12,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 21:25:12,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:12,837 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-18 21:25:12,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:12,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:12,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286241737] [2023-02-18 21:25:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286241737] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:12,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:12,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 21:25:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533183653] [2023-02-18 21:25:12,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:12,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:25:12,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:12,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:25:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:25:12,839 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-18 21:25:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:12,902 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-02-18 21:25:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 21:25:12,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-02-18 21:25:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:12,903 INFO L225 Difference]: With dead ends: 55 [2023-02-18 21:25:12,903 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 21:25:12,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:12,904 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:12,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 21:25:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2023-02-18 21:25:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 47 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-02-18 21:25:12,908 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 12 [2023-02-18 21:25:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:12,909 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-02-18 21:25:12,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-18 21:25:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-02-18 21:25:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 21:25:12,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:12,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:12,918 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-18 21:25:13,116 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-18 21:25:13,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1985999297, now seen corresponding path program 1 times [2023-02-18 21:25:13,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:13,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870498087] [2023-02-18 21:25:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:13,118 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-18 21:25:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:13,119 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-18 21:25:13,121 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-18 21:25:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:13,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 21:25:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:13,175 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-18 21:25:13,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:13,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870498087] [2023-02-18 21:25:13,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870498087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:13,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:13,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 21:25:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741073953] [2023-02-18 21:25:13,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:13,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:25:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:25:13,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:25:13,178 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-18 21:25:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:13,239 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-18 21:25:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 21:25:13,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2023-02-18 21:25:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:13,240 INFO L225 Difference]: With dead ends: 85 [2023-02-18 21:25:13,240 INFO L226 Difference]: Without dead ends: 85 [2023-02-18 21:25:13,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:13,241 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:13,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 165 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-18 21:25:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2023-02-18 21:25:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 66 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2023-02-18 21:25:13,245 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 12 [2023-02-18 21:25:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:13,245 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2023-02-18 21:25:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-18 21:25:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2023-02-18 21:25:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 21:25:13,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:13,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:13,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:13,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:13,453 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash 371929625, now seen corresponding path program 1 times [2023-02-18 21:25:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:13,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312633402] [2023-02-18 21:25:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:13,453 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-18 21:25:13,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:13,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:25:13,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 21:25:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:13,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 21:25:13,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:13,531 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-18 21:25:13,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:13,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:13,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312633402] [2023-02-18 21:25:13,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312633402] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:13,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:25:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898063208] [2023-02-18 21:25:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:25:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:25:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:25:13,536 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:13,606 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-02-18 21:25:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 21:25:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-18 21:25:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:13,608 INFO L225 Difference]: With dead ends: 83 [2023-02-18 21:25:13,608 INFO L226 Difference]: Without dead ends: 83 [2023-02-18 21:25:13,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:25:13,609 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 74 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:13,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 137 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-18 21:25:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2023-02-18 21:25:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 66 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2023-02-18 21:25:13,612 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 13 [2023-02-18 21:25:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:13,612 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2023-02-18 21:25:13,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2023-02-18 21:25:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 21:25:13,613 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:13,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:13,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:13,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1435524838, now seen corresponding path program 1 times [2023-02-18 21:25:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:13,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042060318] [2023-02-18 21:25:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:13,814 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-18 21:25:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:13,815 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-18 21:25:13,817 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-18 21:25:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:13,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 21:25:13,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:13,862 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-18 21:25:13,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:13,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:13,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042060318] [2023-02-18 21:25:13,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042060318] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:13,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:13,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082209743] [2023-02-18 21:25:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:13,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:13,866 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:13,891 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2023-02-18 21:25:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-18 21:25:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:13,893 INFO L225 Difference]: With dead ends: 52 [2023-02-18 21:25:13,893 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 21:25:13,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:13,893 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 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-18 21:25:13,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 21:25:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-02-18 21:25:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 45 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-02-18 21:25:13,897 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2023-02-18 21:25:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:13,897 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-02-18 21:25:13,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-02-18 21:25:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 21:25:13,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:13,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:13,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 (8)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:14,104 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-18 21:25:14,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1355083438, now seen corresponding path program 1 times [2023-02-18 21:25:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:14,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761055768] [2023-02-18 21:25:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:14,105 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-18 21:25:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:14,106 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-18 21:25:14,107 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-18 21:25:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:14,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 21:25:14,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:14,186 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-18 21:25:14,196 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-18 21:25:14,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:14,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761055768] [2023-02-18 21:25:14,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761055768] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:14,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:14,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:25:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712543903] [2023-02-18 21:25:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:14,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:14,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:14,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:14,198 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:25:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:14,246 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2023-02-18 21:25:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:14,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2023-02-18 21:25:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:14,247 INFO L225 Difference]: With dead ends: 47 [2023-02-18 21:25:14,247 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 21:25:14,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-18 21:25:14,248 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:14,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 21:25:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-18 21:25:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 43 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-18 21:25:14,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2023-02-18 21:25:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:14,251 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-18 21:25:14,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:25:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-18 21:25:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 21:25:14,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:14,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:14,258 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-18 21:25:14,458 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-18 21:25:14,459 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1355040639, now seen corresponding path program 1 times [2023-02-18 21:25:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:14,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962262093] [2023-02-18 21:25:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:14,459 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-18 21:25:14,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:14,460 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-18 21:25:14,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 21:25:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:14,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 21:25:14,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:14,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_12))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-18 21:25:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:14,547 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-18 21:25:14,556 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-18 21:25:14,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:14,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962262093] [2023-02-18 21:25:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962262093] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:14,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:14,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:14,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654216136] [2023-02-18 21:25:14,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:14,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 21:25:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:14,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 21:25:14,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2023-02-18 21:25:14,557 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-18 21:25:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:14,648 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2023-02-18 21:25:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:25:14,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2023-02-18 21:25:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:14,649 INFO L225 Difference]: With dead ends: 48 [2023-02-18 21:25:14,649 INFO L226 Difference]: Without dead ends: 48 [2023-02-18 21:25:14,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2023-02-18 21:25:14,650 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:14,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 80 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2023-02-18 21:25:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-18 21:25:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2023-02-18 21:25:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 41 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:25:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-02-18 21:25:14,652 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2023-02-18 21:25:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:14,652 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-02-18 21:25:14,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-18 21:25:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-02-18 21:25:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 21:25:14,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:14,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:14,670 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-18 21:25:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:14,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1579844705, now seen corresponding path program 1 times [2023-02-18 21:25:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464579247] [2023-02-18 21:25:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:14,860 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-18 21:25:14,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:14,861 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:25:14,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 21:25:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:14,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:25:14,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:14,905 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-18 21:25:14,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:14,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:14,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464579247] [2023-02-18 21:25:14,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464579247] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:14,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:14,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 21:25:14,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876773418] [2023-02-18 21:25:14,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:14,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:25:14,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:14,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:25:14,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:25:14,907 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:25:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:14,936 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-18 21:25:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 21:25:14,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2023-02-18 21:25:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:14,937 INFO L225 Difference]: With dead ends: 47 [2023-02-18 21:25:14,937 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 21:25:14,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:25:14,938 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:14,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 21:25:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-18 21:25:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 35 states have internal predecessors, (38), 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-18 21:25:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-02-18 21:25:14,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 14 [2023-02-18 21:25:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:14,940 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-02-18 21:25:14,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-18 21:25:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-02-18 21:25:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:25:14,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:14,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:14,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:15,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:15,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -893009794, now seen corresponding path program 1 times [2023-02-18 21:25:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:15,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139742160] [2023-02-18 21:25:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:15,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:15,150 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-18 21:25:15,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 21:25:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:15,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:25:15,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:15,192 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-18 21:25:15,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:15,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:15,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139742160] [2023-02-18 21:25:15,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139742160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:15,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:15,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605868820] [2023-02-18 21:25:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:15,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:15,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:15,194 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-18 21:25:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:15,209 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-02-18 21:25:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2023-02-18 21:25:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:15,210 INFO L225 Difference]: With dead ends: 46 [2023-02-18 21:25:15,210 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 21:25:15,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 21:25:15,211 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:15,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 21:25:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-02-18 21:25:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 37 states have internal predecessors, (40), 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-18 21:25:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-02-18 21:25:15,213 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2023-02-18 21:25:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:15,213 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-02-18 21:25:15,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-18 21:25:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-02-18 21:25:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:25:15,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:15,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:15,220 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-18 21:25:15,420 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-18 21:25:15,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -893009377, now seen corresponding path program 1 times [2023-02-18 21:25:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:15,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596253022] [2023-02-18 21:25:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:15,421 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-18 21:25:15,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:15,422 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-18 21:25:15,423 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-18 21:25:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:15,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 21:25:15,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:15,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:15,485 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 17 treesize of output 39 [2023-02-18 21:25:15,524 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 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-18 21:25:15,534 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-18 21:25:15,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:15,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:15,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596253022] [2023-02-18 21:25:15,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596253022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:15,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:15,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947376399] [2023-02-18 21:25:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:15,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 21:25:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 21:25:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 21:25:15,535 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-18 21:25:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:15,625 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2023-02-18 21:25:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:25:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2023-02-18 21:25:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:15,626 INFO L225 Difference]: With dead ends: 45 [2023-02-18 21:25:15,626 INFO L226 Difference]: Without dead ends: 45 [2023-02-18 21:25:15,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:25:15,626 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:15,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 81 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-18 21:25:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-02-18 21:25:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-18 21:25:15,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2023-02-18 21:25:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:15,628 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-18 21:25:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-18 21:25:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-18 21:25:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:25:15,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:15,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:15,637 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-18 21:25:15,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:15,829 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash -893009376, now seen corresponding path program 1 times [2023-02-18 21:25:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:15,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974066874] [2023-02-18 21:25:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:15,830 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-18 21:25:15,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:15,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:25:15,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 21:25:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:15,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 21:25:15,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:17,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:17,899 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-18 21:25:17,910 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-18 21:25:17,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:17,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:17,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974066874] [2023-02-18 21:25:17,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974066874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:17,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:17,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:25:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061920438] [2023-02-18 21:25:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:17,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:25:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:25:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=18, Unknown=2, NotChecked=0, Total=30 [2023-02-18 21:25:17,912 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-18 21:25:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:17,990 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-18 21:25:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 21:25:17,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2023-02-18 21:25:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:17,991 INFO L225 Difference]: With dead ends: 40 [2023-02-18 21:25:17,991 INFO L226 Difference]: Without dead ends: 40 [2023-02-18 21:25:17,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=20, Invalid=34, Unknown=2, NotChecked=0, Total=56 [2023-02-18 21:25:17,991 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:17,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 69 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-18 21:25:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-18 21:25:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 37 states have internal predecessors, (40), 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-18 21:25:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-02-18 21:25:17,993 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2023-02-18 21:25:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:17,993 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-02-18 21:25:17,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-18 21:25:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-02-18 21:25:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 21:25:17,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:17,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:18,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 (14)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:18,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:18,194 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 811449152, now seen corresponding path program 1 times [2023-02-18 21:25:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:18,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403454990] [2023-02-18 21:25:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:18,195 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-18 21:25:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:18,196 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-18 21:25:18,197 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-18 21:25:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:18,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 21:25:18,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:18,270 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_probe3_6_~p~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe3_6_~p~0#1.base|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe3_6_~p~0#1.base| (_ bv0 1))))) is different from true [2023-02-18 21:25:18,274 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-18 21:25:18,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:18,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:18,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403454990] [2023-02-18 21:25:18,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403454990] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:18,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:18,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:25:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716260885] [2023-02-18 21:25:18,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:18,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:25:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:25:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2023-02-18 21:25:18,276 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-18 21:25:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:18,392 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-02-18 21:25:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 21:25:18,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2023-02-18 21:25:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:18,392 INFO L225 Difference]: With dead ends: 42 [2023-02-18 21:25:18,392 INFO L226 Difference]: Without dead ends: 34 [2023-02-18 21:25:18,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2023-02-18 21:25:18,393 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:18,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2023-02-18 21:25:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-18 21:25:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-18 21:25:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 31 states have internal predecessors, (31), 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-18 21:25:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2023-02-18 21:25:18,395 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 19 [2023-02-18 21:25:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:18,395 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2023-02-18 21:25:18,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-18 21:25:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2023-02-18 21:25:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 21:25:18,395 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:18,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:18,405 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-18 21:25:18,595 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-18 21:25:18,596 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash 198913356, now seen corresponding path program 1 times [2023-02-18 21:25:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:18,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787826590] [2023-02-18 21:25:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:18,596 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-18 21:25:18,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:18,598 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-18 21:25:18,601 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-18 21:25:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:18,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 21:25:18,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:18,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:18,663 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 17 treesize of output 39 [2023-02-18 21:25:18,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-02-18 21:25:18,713 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-18 21:25:18,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:18,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:18,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787826590] [2023-02-18 21:25:18,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787826590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:18,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:18,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 21:25:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917162333] [2023-02-18 21:25:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:18,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 21:25:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 21:25:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-18 21:25:18,715 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-18 21:25:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:18,808 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2023-02-18 21:25:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 21:25:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 20 [2023-02-18 21:25:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:18,808 INFO L225 Difference]: With dead ends: 33 [2023-02-18 21:25:18,808 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 21:25:18,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-02-18 21:25:18,809 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:18,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 73 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 21:25:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-02-18 21:25:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 30 states have internal predecessors, (30), 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-18 21:25:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2023-02-18 21:25:18,810 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 20 [2023-02-18 21:25:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:18,811 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2023-02-18 21:25:18,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-18 21:25:18,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2023-02-18 21:25:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 21:25:18,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:18,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:18,821 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-18 21:25:19,011 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-18 21:25:19,011 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 198913357, now seen corresponding path program 1 times [2023-02-18 21:25:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:19,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615495929] [2023-02-18 21:25:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:19,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:19,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:19,013 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-18 21:25:19,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 (17)] Waiting until timeout for monitored process [2023-02-18 21:25:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:19,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 21:25:19,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:19,080 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-18 21:25:19,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:19,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:19,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615495929] [2023-02-18 21:25:19,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615495929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:19,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:19,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:25:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437990452] [2023-02-18 21:25:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:19,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:25:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:25:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:25:19,082 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-18 21:25:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:19,126 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2023-02-18 21:25:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:25:19,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2023-02-18 21:25:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:19,126 INFO L225 Difference]: With dead ends: 32 [2023-02-18 21:25:19,126 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 21:25:19,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:25:19,127 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:19,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 21:25:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 21:25:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 29 states have internal predecessors, (29), 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-18 21:25:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 31 transitions. [2023-02-18 21:25:19,129 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 31 transitions. Word has length 20 [2023-02-18 21:25:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:19,129 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 31 transitions. [2023-02-18 21:25:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-18 21:25:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2023-02-18 21:25:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 21:25:19,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:19,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:19,151 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-18 21:25:19,336 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-18 21:25:19,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1871346763, now seen corresponding path program 1 times [2023-02-18 21:25:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:19,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180966662] [2023-02-18 21:25:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:19,337 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-18 21:25:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:19,338 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-18 21:25:19,341 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-18 21:25:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:19,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 21:25:19,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:19,410 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-18 21:25:19,428 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-18 21:25:19,435 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-18 21:25:19,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:19,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:19,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180966662] [2023-02-18 21:25:19,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180966662] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:19,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:19,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 21:25:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088887372] [2023-02-18 21:25:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:19,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 21:25:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 21:25:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:25:19,438 INFO L87 Difference]: Start difference. First operand 32 states and 31 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:19,524 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2023-02-18 21:25:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 21:25:19,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-18 21:25:19,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:19,525 INFO L225 Difference]: With dead ends: 31 [2023-02-18 21:25:19,525 INFO L226 Difference]: Without dead ends: 31 [2023-02-18 21:25:19,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-02-18 21:25:19,526 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:19,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 84 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-18 21:25:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-18 21:25:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 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-18 21:25:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2023-02-18 21:25:19,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 21 [2023-02-18 21:25:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:19,527 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2023-02-18 21:25:19,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2023-02-18 21:25:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 21:25:19,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:19,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:19,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-02-18 21:25:19,728 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-18 21:25:19,729 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2117792404, now seen corresponding path program 1 times [2023-02-18 21:25:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:19,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341050688] [2023-02-18 21:25:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:19,730 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-18 21:25:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:19,730 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-18 21:25:19,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-18 21:25:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:19,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 21:25:19,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:19,819 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-18 21:25:19,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 23 treesize of output 11 [2023-02-18 21:25:19,870 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-18 21:25:19,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:19,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341050688] [2023-02-18 21:25:19,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341050688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:19,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:19,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 21:25:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518433955] [2023-02-18 21:25:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:19,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 21:25:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:19,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 21:25:19,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-02-18 21:25:19,871 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:20,006 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2023-02-18 21:25:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 21:25:20,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-02-18 21:25:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:20,007 INFO L225 Difference]: With dead ends: 30 [2023-02-18 21:25:20,007 INFO L226 Difference]: Without dead ends: 30 [2023-02-18 21:25:20,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-02-18 21:25:20,008 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:20,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 70 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:25:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-18 21:25:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-18 21:25:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 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-18 21:25:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2023-02-18 21:25:20,009 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 22 [2023-02-18 21:25:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:20,009 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2023-02-18 21:25:20,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:25:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2023-02-18 21:25:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 21:25:20,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:20,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:20,019 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-18 21:25:20,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:20,210 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 13 more)] === [2023-02-18 21:25:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1227054995, now seen corresponding path program 1 times [2023-02-18 21:25:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:20,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550345510] [2023-02-18 21:25:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:20,211 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-18 21:25:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:20,212 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:25:20,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-18 21:25:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 21:25:20,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 21:25:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 21:25:20,337 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-18 21:25:20,338 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 21:25:20,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (15 of 16 remaining) [2023-02-18 21:25:20,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-18 21:25:20,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-18 21:25:20,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (12 of 16 remaining) [2023-02-18 21:25:20,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (11 of 16 remaining) [2023-02-18 21:25:20,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (10 of 16 remaining) [2023-02-18 21:25:20,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (9 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (8 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (7 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (4 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2023-02-18 21:25:20,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2023-02-18 21:25:20,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-18 21:25:20,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-02-18 21:25:20,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:20,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:20,545 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:20,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 21:25:20,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:25:20 BoogieIcfgContainer [2023-02-18 21:25:20,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 21:25:20,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 21:25:20,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 21:25:20,573 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 21:25:20,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:11" (3/4) ... [2023-02-18 21:25:20,575 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 21:25:20,628 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 21:25:20,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 21:25:20,628 INFO L158 Benchmark]: Toolchain (without parser) took 9880.34ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 80.5MB in the beginning and 93.4MB in the end (delta: -12.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2023-02-18 21:25:20,629 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 21:25:20,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.30ms. Allocated memory is still 104.9MB. Free memory was 80.1MB in the beginning and 81.1MB in the end (delta: -984.6kB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2023-02-18 21:25:20,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.78ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 78.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 21:25:20,629 INFO L158 Benchmark]: Boogie Preprocessor took 45.22ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 77.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 21:25:20,633 INFO L158 Benchmark]: RCFGBuilder took 343.73ms. Allocated memory is still 104.9MB. Free memory was 77.1MB in the beginning and 62.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 21:25:20,633 INFO L158 Benchmark]: TraceAbstraction took 9020.73ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 62.4MB in the beginning and 96.5MB in the end (delta: -34.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 21:25:20,633 INFO L158 Benchmark]: Witness Printer took 54.97ms. Allocated memory is still 125.8MB. Free memory was 96.5MB in the beginning and 93.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 21:25:20,635 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.14ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.30ms. Allocated memory is still 104.9MB. Free memory was 80.1MB in the beginning and 81.1MB in the end (delta: -984.6kB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.78ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 78.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.22ms. Allocated memory is still 104.9MB. Free memory was 78.6MB in the beginning and 77.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.73ms. Allocated memory is still 104.9MB. Free memory was 77.1MB in the beginning and 62.8MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9020.73ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 62.4MB in the beginning and 96.5MB in the end (delta: -34.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 54.97ms. Allocated memory is still 125.8MB. Free memory was 96.5MB in the beginning and 93.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 782]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L784] struct A a6; VAL [a6={2:0}, ldv_global_msg_list={1:0}] [L793] CALL entry_point() [L786] CALL, EXPR probe3_6(&a6) [L764] int ret = - -3; VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, ret=3] [L765] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L765] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={6:0}, ret=3] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L768] CALL, EXPR f6() [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() [L768] ret = f6() [L769] COND FALSE !(ret<0) [L771] CALL, EXPR g6() [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() [L771] ret = g6() [L772] COND FALSE !(ret<0) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L774] a->p = p VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L775] free(p) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L775] free(p) VAL [a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L775] free(p) [L776] return 0; VAL [\result=0, a={2:0}, a={2:0}, a6={2:0}, ldv_global_msg_list={1:0}, p={6:0}, ret=0] [L786] RET, EXPR probe3_6(&a6) [L786] int ret = probe3_6(&a6); [L787] COND TRUE ret==0 [L788] CALL disconnect_6(&a6) [L782] EXPR a->p VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] [L782] free(a->p) VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] [L782] free(a->p) VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] [L782] free(a->p) VAL [a={2:0}, a={2:0}, a->p={6:0}, a6={2:0}, ldv_global_msg_list={1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 653 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 653 mSDsluCounter, 1991 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 1349 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 642 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 184 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=5, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 263 ConstructedInterpolants, 22 QuantifiedInterpolants, 2404 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-18 21:25:20,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)