./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.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_test11_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:29:24,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:29:24,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:29:24,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:29:24,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:29:24,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:29:24,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:29:24,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:29:24,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:29:24,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:29:24,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:29:24,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:29:24,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:29:24,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:29:24,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:29:24,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:29:24,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:29:24,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:29:24,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:29:24,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:29:24,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:29:24,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:29:24,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:29:24,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:29:24,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:29:24,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:29:24,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:29:24,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:29:24,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:29:24,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:29:24,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:29:24,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:29:24,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:29:24,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:29:24,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:29:24,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:29:24,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:29:24,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:29:24,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:29:24,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:29:24,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:29:24,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:29:24,846 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:29:24,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:29:24,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:29:24,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:29:24,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:29:24,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:29:24,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:29:24,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:29:24,848 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:29:24,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:29:24,849 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:29:24,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:29:24,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:29:24,850 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:29:24,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:29:24,851 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:29:24,851 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2023-02-17 08:29:25,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:29:25,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:29:25,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:29:25,086 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:29:25,086 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:29:25,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2023-02-17 08:29:26,040 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:29:26,243 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:29:26,243 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2023-02-17 08:29:26,253 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d4a4e20/dae77cba4ff74877b4b8c3d2444bb2b2/FLAGbbf9bc3e1 [2023-02-17 08:29:26,265 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d4a4e20/dae77cba4ff74877b4b8c3d2444bb2b2 [2023-02-17 08:29:26,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:29:26,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:29:26,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:29:26,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:29:26,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:29:26,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:29:26" (1/1) ... [2023-02-17 08:29:26,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffde69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:26, skipping insertion in model container [2023-02-17 08:29:26,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:29:26" (1/1) ... [2023-02-17 08:29:26,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:29:26,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:29:26,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:29:26,606 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 08:29:26,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@776db21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:26, skipping insertion in model container [2023-02-17 08:29:26,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:29:26,608 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:29:26,610 INFO L158 Benchmark]: Toolchain (without parser) took 340.83ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 100.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 08:29:26,610 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:29:26,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.03ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 101.4MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 08:29:26,612 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 163.6MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.03ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 101.4MB in the end (delta: 13.4MB). 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_test11_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:29:28,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:29:28,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:29:28,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:29:28,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:29:28,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:29:28,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:29:28,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:29:28,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:29:28,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:29:28,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:29:28,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:29:28,297 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:29:28,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:29:28,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:29:28,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:29:28,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:29:28,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:29:28,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:29:28,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:29:28,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:29:28,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:29:28,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:29:28,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:29:28,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:29:28,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:29:28,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:29:28,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:29:28,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:29:28,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:29:28,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:29:28,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:29:28,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:29:28,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:29:28,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:29:28,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:29:28,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:29:28,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:29:28,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:29:28,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:29:28,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:29:28,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:29:28,328 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:29:28,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:29:28,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:29:28,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:29:28,329 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:29:28,329 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:29:28,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:29:28,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:29:28,330 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:29:28,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:29:28,330 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:29:28,331 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:29:28,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:29:28,332 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:29:28,332 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:29:28,332 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:29:28,332 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:29:28,332 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:29:28,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:29:28,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:29:28,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:29:28,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:29:28,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:29:28,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:29:28,334 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:29:28,335 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2023-02-17 08:29:28,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:29:28,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:29:28,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:29:28,612 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:29:28,612 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:29:28,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2023-02-17 08:29:29,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:29:29,935 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:29:29,935 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2023-02-17 08:29:29,948 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec7196aa/d35f307808614fbeaf936ce8181acc0b/FLAG7ef51d5d7 [2023-02-17 08:29:29,960 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec7196aa/d35f307808614fbeaf936ce8181acc0b [2023-02-17 08:29:29,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:29:29,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:29:29,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:29:29,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:29:29,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:29:29,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:29:29" (1/1) ... [2023-02-17 08:29:29,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165f5be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:29, skipping insertion in model container [2023-02-17 08:29:29,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:29:29" (1/1) ... [2023-02-17 08:29:29,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:29:30,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:29:30,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:29:30,304 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:29:30,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:29:30,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:29:30,396 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:29:30,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:29:30,486 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:29:30,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30 WrapperNode [2023-02-17 08:29:30,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:29:30,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:29:30,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:29:30,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:29:30,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,548 INFO L138 Inliner]: procedures = 169, calls = 88, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 96 [2023-02-17 08:29:30,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:29:30,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:29:30,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:29:30,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:29:30,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:29:30,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:29:30,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:29:30,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:29:30,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (1/1) ... [2023-02-17 08:29:30,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:29:30,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:29:30,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 08:29:30,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 08:29:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-17 08:29:30,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-17 08:29:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2023-02-17 08:29:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2023-02-17 08:29:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:29:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:29:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:29:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:29:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:29:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 08:29:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:29:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:29:30,761 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:29:30,762 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:29:31,078 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:29:31,082 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:29:31,087 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 08:29:31,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:29:31 BoogieIcfgContainer [2023-02-17 08:29:31,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:29:31,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:29:31,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:29:31,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:29:31,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:29:29" (1/3) ... [2023-02-17 08:29:31,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21069329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:29:31, skipping insertion in model container [2023-02-17 08:29:31,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:30" (2/3) ... [2023-02-17 08:29:31,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21069329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:29:31, skipping insertion in model container [2023-02-17 08:29:31,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:29:31" (3/3) ... [2023-02-17 08:29:31,095 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2023-02-17 08:29:31,105 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:29:31,106 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-02-17 08:29:31,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:29:31,151 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;@7c79fd7e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:29:31,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-02-17 08:29:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 08:29:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 08:29:31,158 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:31,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:31,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2113619829, now seen corresponding path program 1 times [2023-02-17 08:29:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:31,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109829243] [2023-02-17 08:29:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:31,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:31,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:31,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 08:29:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:31,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:29:31,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:29:31,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:31,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109829243] [2023-02-17 08:29:31,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109829243] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:31,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:31,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:29:31,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87220732] [2023-02-17 08:29:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:31,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:29:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:29:31,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:31,380 INFO L87 Difference]: Start difference. First operand has 90 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:29:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:31,498 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2023-02-17 08:29:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:29:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-17 08:29:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:31,509 INFO L225 Difference]: With dead ends: 167 [2023-02-17 08:29:31,509 INFO L226 Difference]: Without dead ends: 163 [2023-02-17 08:29:31,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:31,518 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 73 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:31,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 478 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:29:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-17 08:29:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2023-02-17 08:29:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 08:29:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2023-02-17 08:29:31,565 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 11 [2023-02-17 08:29:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:31,565 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2023-02-17 08:29:31,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:29:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2023-02-17 08:29:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 08:29:31,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:31,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:31,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-17 08:29:31,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:31,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1293843786, now seen corresponding path program 1 times [2023-02-17 08:29:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206829017] [2023-02-17 08:29:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:31,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:31,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:31,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 08:29:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:31,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:29:31,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:29:31,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:31,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:31,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206829017] [2023-02-17 08:29:31,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206829017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:31,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:31,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:29:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296348941] [2023-02-17 08:29:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:31,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:29:31,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:31,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:29:31,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:29:31,839 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:29:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:32,010 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2023-02-17 08:29:32,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:29:32,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-17 08:29:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:32,011 INFO L225 Difference]: With dead ends: 163 [2023-02-17 08:29:32,011 INFO L226 Difference]: Without dead ends: 161 [2023-02-17 08:29:32,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:29:32,012 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 70 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:32,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 317 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:29:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-17 08:29:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 88. [2023-02-17 08:29:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 08:29:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-17 08:29:32,019 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 11 [2023-02-17 08:29:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:32,019 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-17 08:29:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:29:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-17 08:29:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:29:32,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:32,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:32,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:32,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:32,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026591, now seen corresponding path program 1 times [2023-02-17 08:29:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:32,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691899574] [2023-02-17 08:29:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:32,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:32,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 08:29:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:32,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:29:32,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:29:32,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:32,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691899574] [2023-02-17 08:29:32,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691899574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:32,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:32,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:29:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421322642] [2023-02-17 08:29:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:32,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:29:32,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:29:32,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:32,288 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:29:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:32,347 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2023-02-17 08:29:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:29:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-17 08:29:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:32,348 INFO L225 Difference]: With dead ends: 160 [2023-02-17 08:29:32,348 INFO L226 Difference]: Without dead ends: 160 [2023-02-17 08:29:32,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:32,349 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 68 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:32,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 369 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:29:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-17 08:29:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 92. [2023-02-17 08:29:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 08:29:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2023-02-17 08:29:32,355 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 17 [2023-02-17 08:29:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:32,355 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2023-02-17 08:29:32,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:29:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2023-02-17 08:29:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:29:32,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:32,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:32,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:32,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:32,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026607, now seen corresponding path program 1 times [2023-02-17 08:29:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834404637] [2023-02-17 08:29:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:32,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:32,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:32,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 08:29:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:32,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:29:32,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:32,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:32,649 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:29:32,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:32,658 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-17 08:29:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:29:32,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:29:32,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:32,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834404637] [2023-02-17 08:29:32,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834404637] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:29:32,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:32,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-17 08:29:32,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573121548] [2023-02-17 08:29:32,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:32,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:29:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:32,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:29:32,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-17 08:29:32,712 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:32,921 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2023-02-17 08:29:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:29:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-17 08:29:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:32,923 INFO L225 Difference]: With dead ends: 133 [2023-02-17 08:29:32,923 INFO L226 Difference]: Without dead ends: 133 [2023-02-17 08:29:32,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-17 08:29:32,923 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:32,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 226 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 101 Unchecked, 0.2s Time] [2023-02-17 08:29:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-17 08:29:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2023-02-17 08:29:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 90 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-17 08:29:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2023-02-17 08:29:32,928 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 17 [2023-02-17 08:29:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:32,929 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2023-02-17 08:29:32,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2023-02-17 08:29:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:29:32,930 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:32,930 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:32,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:33,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:33,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026606, now seen corresponding path program 1 times [2023-02-17 08:29:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:33,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519339545] [2023-02-17 08:29:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:33,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:33,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:33,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:33,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 08:29:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:33,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:29:33,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:33,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:33,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:33,291 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-17 08:29:33,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:29:33,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:29:33,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:33,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:29:33,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:33,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519339545] [2023-02-17 08:29:33,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519339545] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1403328875] [2023-02-17 08:29:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:29:33,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:29:33,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-17 08:29:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:33,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:29:33,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:33,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:33,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:33,508 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:29:33,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:29:33,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:29:33,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:33,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:29:33,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:35,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1403328875] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:35,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:35,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-17 08:29:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694182659] [2023-02-17 08:29:35,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:35,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:29:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:35,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:29:35,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=2, NotChecked=34, Total=132 [2023-02-17 08:29:35,570 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:36,084 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2023-02-17 08:29:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:29:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-17 08:29:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:36,086 INFO L225 Difference]: With dead ends: 226 [2023-02-17 08:29:36,086 INFO L226 Difference]: Without dead ends: 226 [2023-02-17 08:29:36,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=33, Invalid=105, Unknown=2, NotChecked=42, Total=182 [2023-02-17 08:29:36,087 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 145 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:36,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 473 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 530 Invalid, 0 Unknown, 423 Unchecked, 0.5s Time] [2023-02-17 08:29:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-17 08:29:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 148. [2023-02-17 08:29:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 103 states have (on average 1.6601941747572815) internal successors, (171), 130 states have internal predecessors, (171), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-17 08:29:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2023-02-17 08:29:36,093 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 17 [2023-02-17 08:29:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:36,093 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2023-02-17 08:29:36,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2023-02-17 08:29:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:29:36,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:36,094 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:36,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:36,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:36,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:36,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2086429614, now seen corresponding path program 1 times [2023-02-17 08:29:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:36,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407922957] [2023-02-17 08:29:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:36,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:36,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:36,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:36,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 08:29:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:36,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:29:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:29:36,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:36,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:36,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407922957] [2023-02-17 08:29:36,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407922957] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:36,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:36,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:29:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483340220] [2023-02-17 08:29:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:36,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:29:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:29:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:36,577 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:29:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:36,602 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2023-02-17 08:29:36,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:29:36,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-17 08:29:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:36,604 INFO L225 Difference]: With dead ends: 130 [2023-02-17 08:29:36,604 INFO L226 Difference]: Without dead ends: 128 [2023-02-17 08:29:36,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:36,604 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 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-17 08:29:36,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:29:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-17 08:29:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-02-17 08:29:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 114 states have internal predecessors, (146), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-17 08:29:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2023-02-17 08:29:36,609 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 17 [2023-02-17 08:29:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:36,609 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2023-02-17 08:29:36,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:29:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2023-02-17 08:29:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:29:36,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:36,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:36,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:36,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:36,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1138254343, now seen corresponding path program 1 times [2023-02-17 08:29:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:36,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122552833] [2023-02-17 08:29:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:36,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:36,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:36,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 08:29:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:36,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:29:36,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:29:36,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:29:36,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:36,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122552833] [2023-02-17 08:29:36,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122552833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:29:36,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:36,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-17 08:29:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162870024] [2023-02-17 08:29:36,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:36,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:29:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:29:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:29:36,985 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:29:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:37,156 INFO L93 Difference]: Finished difference Result 131 states and 170 transitions. [2023-02-17 08:29:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:29:37,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-17 08:29:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:37,158 INFO L225 Difference]: With dead ends: 131 [2023-02-17 08:29:37,158 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 08:29:37,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:29:37,158 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 201 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:37,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 337 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:29:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 08:29:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-02-17 08:29:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.6222222222222222) internal successors, (146), 114 states have internal predecessors, (146), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-17 08:29:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2023-02-17 08:29:37,162 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 18 [2023-02-17 08:29:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:37,162 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2023-02-17 08:29:37,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:29:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2023-02-17 08:29:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:29:37,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:37,163 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:37,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:37,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:37,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 968466533, now seen corresponding path program 1 times [2023-02-17 08:29:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:37,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072972313] [2023-02-17 08:29:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:37,374 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:37,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 08:29:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:37,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:29:37,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:37,444 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)))) is different from true [2023-02-17 08:29:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:29:37,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:37,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ bv0 1))))) is different from false [2023-02-17 08:29:37,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072972313] [2023-02-17 08:29:37,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072972313] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1386870618] [2023-02-17 08:29:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:37,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:29:37,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:29:37,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-17 08:29:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:37,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:29:37,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:37,688 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|))))) is different from true [2023-02-17 08:29:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:29:37,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:37,701 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21|))))) is different from false [2023-02-17 08:29:37,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1386870618] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:37,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:37,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 08:29:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551483075] [2023-02-17 08:29:37,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:37,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:29:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:37,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:29:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=127, Unknown=4, NotChecked=100, Total=272 [2023-02-17 08:29:37,703 INFO L87 Difference]: Start difference. First operand 129 states and 168 transitions. Second operand has 13 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:29:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:38,220 INFO L93 Difference]: Finished difference Result 189 states and 236 transitions. [2023-02-17 08:29:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:29:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-02-17 08:29:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:38,227 INFO L225 Difference]: With dead ends: 189 [2023-02-17 08:29:38,227 INFO L226 Difference]: Without dead ends: 184 [2023-02-17 08:29:38,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=277, Unknown=4, NotChecked=148, Total=506 [2023-02-17 08:29:38,228 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 146 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:38,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 514 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 470 Invalid, 1 Unknown, 336 Unchecked, 0.5s Time] [2023-02-17 08:29:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-17 08:29:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 124. [2023-02-17 08:29:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.6470588235294117) internal successors, (140), 110 states have internal predecessors, (140), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-17 08:29:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2023-02-17 08:29:38,232 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 21 [2023-02-17 08:29:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:38,232 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2023-02-17 08:29:38,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:29:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2023-02-17 08:29:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:29:38,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:38,233 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:38,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:38,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:38,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:38,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash -406257806, now seen corresponding path program 1 times [2023-02-17 08:29:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:38,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253388172] [2023-02-17 08:29:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:38,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:38,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:38,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:38,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 08:29:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:38,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:29:38,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:38,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:38,730 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-17 08:29:38,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:38,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:29:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-17 08:29:38,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:29:38,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:38,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253388172] [2023-02-17 08:29:38,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253388172] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:29:38,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:38,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-17 08:29:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061363633] [2023-02-17 08:29:38,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:38,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:29:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:29:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-17 08:29:38,774 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:29:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:38,986 INFO L93 Difference]: Finished difference Result 174 states and 227 transitions. [2023-02-17 08:29:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:29:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-17 08:29:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:38,987 INFO L225 Difference]: With dead ends: 174 [2023-02-17 08:29:38,987 INFO L226 Difference]: Without dead ends: 174 [2023-02-17 08:29:38,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-17 08:29:38,988 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 55 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:38,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 327 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 268 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2023-02-17 08:29:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-17 08:29:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2023-02-17 08:29:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 120 states have internal predecessors, (158), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-17 08:29:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2023-02-17 08:29:38,991 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 25 [2023-02-17 08:29:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:38,992 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2023-02-17 08:29:38,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:29:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2023-02-17 08:29:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:29:38,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:38,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:39,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:39,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:39,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:39,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash -406257805, now seen corresponding path program 1 times [2023-02-17 08:29:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:39,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437480413] [2023-02-17 08:29:39,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:39,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:39,217 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:39,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 08:29:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:39,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 08:29:39,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:39,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:39,305 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-17 08:29:39,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:39,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:29:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-17 08:29:39,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:39,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:39,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437480413] [2023-02-17 08:29:39,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437480413] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:39,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278186835] [2023-02-17 08:29:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:39,400 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:29:39,401 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:29:39,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-17 08:29:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:39,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:29:39,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:39,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:39,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:39,556 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:29:39,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:29:39,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:29:39,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:39,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-17 08:29:39,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:39,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [278186835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:39,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:39,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-17 08:29:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189285295] [2023-02-17 08:29:39,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:29:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:29:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2023-02-17 08:29:39,614 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:29:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:40,165 INFO L93 Difference]: Finished difference Result 266 states and 343 transitions. [2023-02-17 08:29:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:29:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-02-17 08:29:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:40,166 INFO L225 Difference]: With dead ends: 266 [2023-02-17 08:29:40,166 INFO L226 Difference]: Without dead ends: 266 [2023-02-17 08:29:40,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=224, Unknown=2, NotChecked=62, Total=342 [2023-02-17 08:29:40,167 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 111 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:40,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 906 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 654 Invalid, 0 Unknown, 384 Unchecked, 0.5s Time] [2023-02-17 08:29:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-17 08:29:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 195. [2023-02-17 08:29:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 149 states have (on average 1.6442953020134228) internal successors, (245), 172 states have internal predecessors, (245), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-17 08:29:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2023-02-17 08:29:40,171 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 25 [2023-02-17 08:29:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:40,171 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2023-02-17 08:29:40,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:29:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2023-02-17 08:29:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:29:40,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:40,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:40,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-02-17 08:29:40,379 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 (13)] Ended with exit code 0 [2023-02-17 08:29:40,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:40,573 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -911816431, now seen corresponding path program 1 times [2023-02-17 08:29:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960146848] [2023-02-17 08:29:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:40,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:40,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:40,575 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:40,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 08:29:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:40,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:29:40,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:29:40,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:40,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:40,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960146848] [2023-02-17 08:29:40,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960146848] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:40,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:40,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:29:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520480694] [2023-02-17 08:29:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:29:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:29:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:40,669 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:40,687 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2023-02-17 08:29:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:29:40,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-17 08:29:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:40,688 INFO L225 Difference]: With dead ends: 126 [2023-02-17 08:29:40,688 INFO L226 Difference]: Without dead ends: 124 [2023-02-17 08:29:40,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:40,688 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:40,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:29:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-17 08:29:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-02-17 08:29:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 110 states have internal predecessors, (138), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:29:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 159 transitions. [2023-02-17 08:29:40,691 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 159 transitions. Word has length 25 [2023-02-17 08:29:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:40,691 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 159 transitions. [2023-02-17 08:29:40,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2023-02-17 08:29:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 08:29:40,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:40,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:40,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-02-17 08:29:40,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:40,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash 290909999, now seen corresponding path program 1 times [2023-02-17 08:29:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:40,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556035586] [2023-02-17 08:29:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:40,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:40,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:40,900 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:40,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 08:29:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:40,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:29:40,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 08:29:40,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:40,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:40,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556035586] [2023-02-17 08:29:40,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556035586] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:40,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:40,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:29:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800119337] [2023-02-17 08:29:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:40,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:29:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:29:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:40,995 INFO L87 Difference]: Start difference. First operand 124 states and 159 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 08:29:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:41,034 INFO L93 Difference]: Finished difference Result 174 states and 208 transitions. [2023-02-17 08:29:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:29:41,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-17 08:29:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:41,036 INFO L225 Difference]: With dead ends: 174 [2023-02-17 08:29:41,036 INFO L226 Difference]: Without dead ends: 174 [2023-02-17 08:29:41,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:29:41,036 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 58 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:41,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 374 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:29:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-17 08:29:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2023-02-17 08:29:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 110 states have internal predecessors, (137), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:29:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2023-02-17 08:29:41,039 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 26 [2023-02-17 08:29:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:41,039 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2023-02-17 08:29:41,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 08:29:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2023-02-17 08:29:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 08:29:41,039 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:41,039 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:41,048 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 (16)] Ended with exit code 0 [2023-02-17 08:29:41,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:41,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1178413680, now seen corresponding path program 1 times [2023-02-17 08:29:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:41,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226161607] [2023-02-17 08:29:41,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:41,243 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:41,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 08:29:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:41,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:29:41,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:29:41,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 08:29:41,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:41,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226161607] [2023-02-17 08:29:41,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226161607] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:29:41,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:41,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-17 08:29:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44371474] [2023-02-17 08:29:41,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:41,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:29:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:29:41,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:29:41,406 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:29:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:41,613 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2023-02-17 08:29:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:29:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-02-17 08:29:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:41,614 INFO L225 Difference]: With dead ends: 123 [2023-02-17 08:29:41,614 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 08:29:41,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:29:41,615 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 124 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:41,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 331 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:29:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 08:29:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-02-17 08:29:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 109 states have internal predecessors, (134), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:29:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2023-02-17 08:29:41,617 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 26 [2023-02-17 08:29:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:41,618 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2023-02-17 08:29:41,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:29:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2023-02-17 08:29:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:29:41,618 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:41,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:41,626 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-17 08:29:41,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:41,825 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 428272563, now seen corresponding path program 1 times [2023-02-17 08:29:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:41,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585279883] [2023-02-17 08:29:41,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:41,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:41,827 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:41,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 08:29:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:41,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 08:29:41,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:41,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:41,901 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-17 08:29:41,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:41,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:29:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:29:41,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:29:41,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:41,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585279883] [2023-02-17 08:29:41,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585279883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:29:41,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:29:41,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:29:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703955527] [2023-02-17 08:29:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:29:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:29:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:29:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-17 08:29:41,912 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:42,033 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2023-02-17 08:29:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:29:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-02-17 08:29:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:42,034 INFO L225 Difference]: With dead ends: 157 [2023-02-17 08:29:42,034 INFO L226 Difference]: Without dead ends: 157 [2023-02-17 08:29:42,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-17 08:29:42,035 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:42,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 244 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 146 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2023-02-17 08:29:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-17 08:29:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2023-02-17 08:29:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.5) internal successors, (132), 108 states have internal predecessors, (132), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:29:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2023-02-17 08:29:42,040 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 27 [2023-02-17 08:29:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:42,040 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2023-02-17 08:29:42,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:29:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2023-02-17 08:29:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:29:42,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:42,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:42,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:42,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:42,251 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash 428272564, now seen corresponding path program 1 times [2023-02-17 08:29:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:42,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910398165] [2023-02-17 08:29:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:42,253 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:42,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 08:29:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:42,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 08:29:42,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:42,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:42,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:42,365 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_178 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_178))))) is different from true [2023-02-17 08:29:42,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:29:42,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:29:42,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:42,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:42,405 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_179 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_179))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:29:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:29:42,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:29:42,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:42,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-17 08:29:42,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:44,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:44,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910398165] [2023-02-17 08:29:44,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910398165] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:44,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2116102086] [2023-02-17 08:29:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:44,549 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:29:44,550 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:29:44,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-17 08:29:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:44,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 08:29:44,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:44,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:44,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:44,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:44,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:29:44,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:44,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:44,771 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_204 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_204))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:29:44,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:29:44,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:29:44,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:44,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-17 08:29:44,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:44,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2116102086] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:44,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:44,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2023-02-17 08:29:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318436001] [2023-02-17 08:29:44,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:44,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:29:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:29:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=152, Unknown=4, NotChecked=78, Total=272 [2023-02-17 08:29:44,842 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 08:29:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:45,581 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2023-02-17 08:29:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:29:45,581 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-02-17 08:29:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:45,582 INFO L225 Difference]: With dead ends: 224 [2023-02-17 08:29:45,582 INFO L226 Difference]: Without dead ends: 224 [2023-02-17 08:29:45,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=62, Invalid=252, Unknown=4, NotChecked=102, Total=420 [2023-02-17 08:29:45,583 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 196 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 20 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 476 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:45,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 710 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 676 Invalid, 17 Unknown, 476 Unchecked, 0.7s Time] [2023-02-17 08:29:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-17 08:29:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 121. [2023-02-17 08:29:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 107 states have internal predecessors, (130), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:29:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2023-02-17 08:29:45,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 27 [2023-02-17 08:29:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:45,586 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2023-02-17 08:29:45,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 08:29:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2023-02-17 08:29:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 08:29:45,586 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:45,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:45,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-02-17 08:29:45,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:45,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:45,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash -746927052, now seen corresponding path program 1 times [2023-02-17 08:29:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:45,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976114877] [2023-02-17 08:29:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:45,991 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:46,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 08:29:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:46,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 08:29:46,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:46,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:29:46,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:46,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:46,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2023-02-17 08:29:46,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:46,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 46 [2023-02-17 08:29:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 08:29:46,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:46,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:46,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2023-02-17 08:29:46,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976114877] [2023-02-17 08:29:46,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976114877] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1244435674] [2023-02-17 08:29:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:29:46,491 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:29:46,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-17 08:29:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:46,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 08:29:46,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:46,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:46,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:46,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:46,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:29:48,787 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|))) is different from true [2023-02-17 08:29:48,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:48,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 43 [2023-02-17 08:29:48,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-02-17 08:29:48,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:48,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-17 08:29:48,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:29:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-17 08:29:48,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:48,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:48,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 08:29:48,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_253) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|)) is different from false [2023-02-17 08:29:48,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1244435674] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:48,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:29:48,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-02-17 08:29:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706328907] [2023-02-17 08:29:48,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:29:48,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 08:29:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:29:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 08:29:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=897, Unknown=2, NotChecked=122, Total=1122 [2023-02-17 08:29:48,958 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:29:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:29:56,692 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2023-02-17 08:29:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 08:29:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-17 08:29:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:29:56,694 INFO L225 Difference]: With dead ends: 200 [2023-02-17 08:29:56,694 INFO L226 Difference]: Without dead ends: 200 [2023-02-17 08:29:56,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=374, Invalid=2281, Unknown=5, NotChecked=202, Total=2862 [2023-02-17 08:29:56,695 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 367 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:29:56,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1601 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1483 Invalid, 0 Unknown, 149 Unchecked, 1.3s Time] [2023-02-17 08:29:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-17 08:29:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 93. [2023-02-17 08:29:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.359375) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-17 08:29:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-02-17 08:29:56,703 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 29 [2023-02-17 08:29:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:29:56,703 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-02-17 08:29:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:29:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-02-17 08:29:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 08:29:56,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:29:56,705 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:29:56,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:56,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 (21)] Forceful destruction successful, exit code 0 [2023-02-17 08:29:57,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:57,115 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-02-17 08:29:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:29:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -746927051, now seen corresponding path program 1 times [2023-02-17 08:29:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:29:57,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145785211] [2023-02-17 08:29:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:57,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:29:57,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:29:57,119 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:29:57,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 08:29:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:57,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 08:29:57,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:57,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:57,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:57,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:29:57,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:29:57,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:29:57,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:57,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 57 [2023-02-17 08:29:57,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-17 08:29:57,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2023-02-17 08:29:57,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:57,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2023-02-17 08:29:57,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-17 08:29:57,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 08:29:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:29:57,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:29:57,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:29:57,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2023-02-17 08:29:57,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_11) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (.cse1 (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_12) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) (and (or (and (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)))) .cse0 .cse1) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|))) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv4 32)))) .cse0 .cse1)) is different from false [2023-02-17 08:29:57,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:29:57,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145785211] [2023-02-17 08:29:57,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145785211] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:29:57,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834545754] [2023-02-17 08:29:57,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:29:57,698 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:29:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:29:57,699 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:29:57,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-17 08:29:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:29:57,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 08:29:57,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:29:57,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:29:57,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:00,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:00,050 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-17 08:30:00,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:00,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:00,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2023-02-17 08:30:00,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-17 08:30:00,270 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_304 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_304)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|))))) is different from true [2023-02-17 08:30:00,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:00,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:00,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:00,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 38 [2023-02-17 08:30:00,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:00,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 84 [2023-02-17 08:30:00,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:00,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 54 [2023-02-17 08:30:00,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-17 08:30:00,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 154 [2023-02-17 08:30:00,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2023-02-17 08:30:00,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 1 [2023-02-17 08:30:00,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2023-02-17 08:30:00,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2023-02-17 08:30:00,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2023-02-17 08:30:00,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2023-02-17 08:30:00,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-02-17 08:30:01,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:01,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 43 new quantified variables, introduced 561 case distinctions, treesize of input 1342 treesize of output 5487 [2023-02-17 08:30:13,195 INFO L217 Elim1Store]: Index analysis took 11104 ms [2023-02-17 08:30:13,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:13,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 963 treesize of output 4577