./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bcce9a9edb6d3d97e1dc81d42ff33dae1a3a6c5a4c6632dbb9f71fe2bbff6634 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:21:17,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:21:17,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:21:17,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:21:17,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:21:17,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:21:17,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:21:17,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:21:17,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:21:17,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:21:17,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:21:17,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:21:17,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:21:17,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:21:17,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:21:17,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:21:17,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:21:17,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:21:17,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:21:17,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:21:17,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:21:17,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:21:17,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:21:17,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:21:17,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:21:17,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:21:17,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:21:17,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:21:17,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:21:17,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:21:17,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:21:17,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:21:17,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:21:17,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:21:17,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:21:17,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:21:17,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:21:17,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:21:17,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:21:17,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:21:17,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:21:17,395 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:21:17,430 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:21:17,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:21:17,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:21:17,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:21:17,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:21:17,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:21:17,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:21:17,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:21:17,432 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:21:17,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:21:17,433 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:21:17,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:21:17,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:21:17,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:21:17,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:21:17,434 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:21:17,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:21:17,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:21:17,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:21:17,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:21:17,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:21:17,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:21:17,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:21:17,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:21:17,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:21:17,436 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:21:17,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:21:17,437 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:21:17,437 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 -> bcce9a9edb6d3d97e1dc81d42ff33dae1a3a6c5a4c6632dbb9f71fe2bbff6634 [2023-02-15 01:21:17,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:21:17,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:21:17,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:21:17,646 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:21:17,646 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:21:17,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2023-02-15 01:21:18,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:21:18,793 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:21:18,794 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2023-02-15 01:21:18,808 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad823059/86f775e4b96b43d5a437b1d2c60c95f7/FLAGb91cc8e34 [2023-02-15 01:21:18,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad823059/86f775e4b96b43d5a437b1d2c60c95f7 [2023-02-15 01:21:18,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:21:18,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:21:18,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:21:18,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:21:18,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:21:18,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:21:18" (1/1) ... [2023-02-15 01:21:18,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2faaed01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:18, skipping insertion in model container [2023-02-15 01:21:18,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:21:18" (1/1) ... [2023-02-15 01:21:18,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:21:18,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:21:19,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:21:19,176 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-15 01:21:19,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4936e655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:19, skipping insertion in model container [2023-02-15 01:21:19,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:21:19,178 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 01:21:19,179 INFO L158 Benchmark]: Toolchain (without parser) took 357.93ms. Allocated memory is still 132.1MB. Free memory was 94.3MB in the beginning and 80.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:21:19,180 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:21:19,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.42ms. Allocated memory is still 132.1MB. Free memory was 94.0MB in the beginning and 80.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:21:19,182 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 132.1MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.42ms. Allocated memory is still 132.1MB. Free memory was 94.0MB in the beginning and 80.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. 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_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bcce9a9edb6d3d97e1dc81d42ff33dae1a3a6c5a4c6632dbb9f71fe2bbff6634 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:21:20,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:21:20,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:21:20,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:21:20,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:21:20,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:21:20,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:21:20,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:21:20,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:21:20,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:21:20,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:21:20,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:21:20,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:21:20,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:21:20,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:21:20,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:21:20,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:21:20,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:21:20,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:21:20,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:21:20,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:21:20,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:21:20,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:21:20,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:21:20,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:21:20,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:21:20,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:21:20,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:21:20,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:21:20,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:21:20,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:21:20,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:21:20,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:21:20,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:21:20,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:21:20,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:21:20,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:21:20,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:21:20,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:21:20,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:21:20,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:21:20,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 01:21:20,915 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:21:20,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:21:20,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:21:20,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:21:20,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:21:20,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:21:20,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:21:20,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:21:20,918 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:21:20,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:21:20,919 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:21:20,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:21:20,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:21:20,920 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:21:20,920 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:21:20,920 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:21:20,920 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:21:20,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:21:20,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:21:20,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:21:20,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:21:20,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:21:20,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:21:20,921 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:21:20,921 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:21:20,922 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:21:20,922 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:21:20,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:21:20,922 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:21:20,922 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:21:20,922 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 -> bcce9a9edb6d3d97e1dc81d42ff33dae1a3a6c5a4c6632dbb9f71fe2bbff6634 [2023-02-15 01:21:21,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:21:21,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:21:21,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:21:21,177 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:21:21,177 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:21:21,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2023-02-15 01:21:22,219 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:21:22,439 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:21:22,440 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test7-2.i [2023-02-15 01:21:22,454 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52d959a5/81a5d9dac59d41a6a000f0a4c126c4d5/FLAG2690bc8d6 [2023-02-15 01:21:22,467 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52d959a5/81a5d9dac59d41a6a000f0a4c126c4d5 [2023-02-15 01:21:22,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:21:22,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:21:22,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:21:22,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:21:22,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:21:22,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:21:22" (1/1) ... [2023-02-15 01:21:22,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@887a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:22, skipping insertion in model container [2023-02-15 01:21:22,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:21:22" (1/1) ... [2023-02-15 01:21:22,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:21:22,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:21:22,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:21:22,880 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 01:21:22,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:21:22,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:21:22,929 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:21:22,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:21:23,017 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:21:23,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23 WrapperNode [2023-02-15 01:21:23,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:21:23,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:21:23,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:21:23,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:21:23,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,072 INFO L138 Inliner]: procedures = 170, calls = 78, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 60 [2023-02-15 01:21:23,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:21:23,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:21:23,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:21:23,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:21:23,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:21:23,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:21:23,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:21:23,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:21:23,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (1/1) ... [2023-02-15 01:21:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:21:23,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:21:23,163 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-15 01:21:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 01:21:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 01:21:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:21:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:21:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:21:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:21:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:21:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:21:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:21:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:21:23,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:21:23,206 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-15 01:21:23,313 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:21:23,315 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:21:23,522 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:21:23,527 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:21:23,527 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 01:21:23,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:21:23 BoogieIcfgContainer [2023-02-15 01:21:23,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:21:23,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:21:23,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:21:23,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:21:23,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:21:22" (1/3) ... [2023-02-15 01:21:23,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cdf2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:21:23, skipping insertion in model container [2023-02-15 01:21:23,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:21:23" (2/3) ... [2023-02-15 01:21:23,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cdf2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:21:23, skipping insertion in model container [2023-02-15 01:21:23,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:21:23" (3/3) ... [2023-02-15 01:21:23,539 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test7-2.i [2023-02-15 01:21:23,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:21:23,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-02-15 01:21:23,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:21:23,583 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;@12f9d3c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:21:23,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-02-15 01:21:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 38 states have internal predecessors, (43), 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-15 01:21:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:21:23,596 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:23,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:23,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1741342760, now seen corresponding path program 1 times [2023-02-15 01:21:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:23,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127883536] [2023-02-15 01:21:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:23,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:23,618 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-15 01:21:23,619 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-15 01:21:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:23,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:21:23,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:23,765 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-15 01:21:23,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:23,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:23,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127883536] [2023-02-15 01:21:23,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127883536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:23,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:23,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:21:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778735909] [2023-02-15 01:21:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:23,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:23,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:23,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:23,813 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 38 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:23,907 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2023-02-15 01:21:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:23,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 01:21:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:23,917 INFO L225 Difference]: With dead ends: 76 [2023-02-15 01:21:23,918 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 01:21:23,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:23,921 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:23,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:21:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 01:21:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2023-02-15 01:21:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 39 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-02-15 01:21:23,949 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2023-02-15 01:21:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:23,950 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-02-15 01:21:23,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-02-15 01:21:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:21:23,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:23,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:23,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:21:24,159 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-15 01:21:24,160 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1741377529, now seen corresponding path program 1 times [2023-02-15 01:21:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717295666] [2023-02-15 01:21:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:24,165 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-15 01:21:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:24,167 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-15 01:21:24,169 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-15 01:21:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:24,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:21:24,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:24,234 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-15 01:21:24,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:24,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:24,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717295666] [2023-02-15 01:21:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717295666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:24,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:24,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918355347] [2023-02-15 01:21:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:24,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:24,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:24,237 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:24,258 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-02-15 01:21:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:24,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 01:21:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:24,259 INFO L225 Difference]: With dead ends: 42 [2023-02-15 01:21:24,259 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 01:21:24,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:24,261 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:24,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 01:21:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-02-15 01:21:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 38 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-02-15 01:21:24,265 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 12 [2023-02-15 01:21:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:24,265 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-02-15 01:21:24,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-02-15 01:21:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:21:24,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:24,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:24,276 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-15 01:21:24,466 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-15 01:21:24,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash -810814201, now seen corresponding path program 1 times [2023-02-15 01:21:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:24,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935818231] [2023-02-15 01:21:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:24,468 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-15 01:21:24,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:24,469 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-15 01:21:24,472 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-15 01:21:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:24,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:21:24,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:24,558 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-15 01:21:24,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:24,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:24,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935818231] [2023-02-15 01:21:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935818231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:24,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:24,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:21:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167778410] [2023-02-15 01:21:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:24,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:24,562 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:24,606 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2023-02-15 01:21:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 01:21:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:24,607 INFO L225 Difference]: With dead ends: 48 [2023-02-15 01:21:24,608 INFO L226 Difference]: Without dead ends: 48 [2023-02-15 01:21:24,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:21:24,610 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:24,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-15 01:21:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2023-02-15 01:21:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 40 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-02-15 01:21:24,621 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 12 [2023-02-15 01:21:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:24,621 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-02-15 01:21:24,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-02-15 01:21:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:21:24,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:24,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:24,637 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 (4)] Ended with exit code 0 [2023-02-15 01:21:24,829 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-15 01:21:24,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1851871381, now seen corresponding path program 1 times [2023-02-15 01:21:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254334731] [2023-02-15 01:21:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:24,832 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-15 01:21:24,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 01:21:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:24,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:21:24,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:25,012 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-15 01:21:25,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:25,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:25,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254334731] [2023-02-15 01:21:25,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254334731] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:25,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:25,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:25,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154240025] [2023-02-15 01:21:25,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:25,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:21:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:21:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:21:25,014 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:25,080 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2023-02-15 01:21:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:21:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:21:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:25,081 INFO L225 Difference]: With dead ends: 72 [2023-02-15 01:21:25,081 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 01:21:25,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:21:25,082 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:25,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 128 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:21:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 01:21:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2023-02-15 01:21:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 46 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2023-02-15 01:21:25,086 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 13 [2023-02-15 01:21:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:25,087 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2023-02-15 01:21:25,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2023-02-15 01:21:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:21:25,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:25,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:25,111 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-15 01:21:25,311 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-15 01:21:25,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:25,312 INFO L85 PathProgramCache]: Analyzing trace with hash 635641452, now seen corresponding path program 1 times [2023-02-15 01:21:25,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:25,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812016113] [2023-02-15 01:21:25,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:25,313 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-15 01:21:25,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:25,314 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-15 01:21:25,316 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-15 01:21:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:25,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:21:25,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:25,387 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-15 01:21:25,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:25,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:25,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812016113] [2023-02-15 01:21:25,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812016113] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:25,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:25,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:21:25,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577287151] [2023-02-15 01:21:25,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:25,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:25,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:25,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:25,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:25,389 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:25,406 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-15 01:21:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:21:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:25,407 INFO L225 Difference]: With dead ends: 47 [2023-02-15 01:21:25,407 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 01:21:25,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:25,408 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 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-15 01:21:25,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 01:21:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-02-15 01:21:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-02-15 01:21:25,423 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2023-02-15 01:21:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:25,424 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-02-15 01:21:25,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-02-15 01:21:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:21:25,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:25,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:25,434 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-15 01:21:25,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:25,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1573437893, now seen corresponding path program 1 times [2023-02-15 01:21:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605075315] [2023-02-15 01:21:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:25,633 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-15 01:21:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:25,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:21:25,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 01:21:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:25,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:21:25,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:25,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 01:21:25,778 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-15 01:21:25,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:25,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605075315] [2023-02-15 01:21:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605075315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:25,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:25,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910628592] [2023-02-15 01:21:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:25,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:25,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:25,782 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:25,835 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-02-15 01:21:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 01:21:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:25,836 INFO L225 Difference]: With dead ends: 54 [2023-02-15 01:21:25,836 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 01:21:25,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:25,837 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:25,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 01:21:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2023-02-15 01:21:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-02-15 01:21:25,840 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 14 [2023-02-15 01:21:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:25,840 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-02-15 01:21:25,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-02-15 01:21:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:21:25,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:25,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:25,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-15 01:21:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:26,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1573390129, now seen corresponding path program 1 times [2023-02-15 01:21:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:26,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307537043] [2023-02-15 01:21:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:26,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:26,050 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-15 01:21:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 01:21:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:26,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 01:21:26,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:26,099 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-15 01:21:26,134 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2023-02-15 01:21:26,160 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:21:26,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:21:26,189 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-15 01:21:26,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:26,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:26,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307537043] [2023-02-15 01:21:26,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307537043] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:26,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:26,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:21:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416764559] [2023-02-15 01:21:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:26,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:21:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:26,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:21:26,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-15 01:21:26,191 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:26,216 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-02-15 01:21:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:21:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 01:21:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:26,217 INFO L225 Difference]: With dead ends: 41 [2023-02-15 01:21:26,217 INFO L226 Difference]: Without dead ends: 41 [2023-02-15 01:21:26,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-15 01:21:26,218 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:26,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 64 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2023-02-15 01:21:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-15 01:21:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-02-15 01:21:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-15 01:21:26,221 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 14 [2023-02-15 01:21:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:26,221 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-15 01:21:26,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-15 01:21:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:21:26,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:26,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:26,246 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-15 01:21:26,430 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-15 01:21:26,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1573390130, now seen corresponding path program 1 times [2023-02-15 01:21:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:26,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8619268] [2023-02-15 01:21:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:26,432 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-15 01:21:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:26,433 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-15 01:21:26,433 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-15 01:21:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:26,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:21:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:26,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 01:21:26,504 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-15 01:21:26,520 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:21:26,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:21:26,536 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-15 01:21:26,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:26,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8619268] [2023-02-15 01:21:26,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8619268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:26,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:26,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367088565] [2023-02-15 01:21:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:26,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:26,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 01:21:26,537 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:26,587 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-02-15 01:21:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 01:21:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:26,588 INFO L225 Difference]: With dead ends: 52 [2023-02-15 01:21:26,588 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 01:21:26,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 01:21:26,589 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:26,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 81 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2023-02-15 01:21:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 01:21:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2023-02-15 01:21:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:21:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-15 01:21:26,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 14 [2023-02-15 01:21:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:26,591 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-15 01:21:26,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-15 01:21:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:21:26,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:26,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:26,610 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-15 01:21:26,793 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-15 01:21:26,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1802965784, now seen corresponding path program 1 times [2023-02-15 01:21:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:26,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325711415] [2023-02-15 01:21:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:26,794 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-15 01:21:26,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:26,795 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-15 01:21:26,796 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-15 01:21:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:26,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 01:21:26,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:26,912 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a7~0#1.base_6| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a7~0#1.base_6|) (_ bv0 1)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a7~0#1.base_6| (_ bv0 1))))) is different from true [2023-02-15 01:21:26,918 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-15 01:21:26,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:26,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:26,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325711415] [2023-02-15 01:21:26,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325711415] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:26,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:26,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880661777] [2023-02-15 01:21:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:26,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:26,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 01:21:26,921 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:26,956 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2023-02-15 01:21:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-15 01:21:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:26,958 INFO L225 Difference]: With dead ends: 43 [2023-02-15 01:21:26,958 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 01:21:26,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 01:21:26,961 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:26,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2023-02-15 01:21:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 01:21:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-15 01:21:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 31 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-02-15 01:21:26,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 14 [2023-02-15 01:21:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:26,970 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-02-15 01:21:26,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-02-15 01:21:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:21:26,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:26,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:26,979 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-15 01:21:27,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:27,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 984869777, now seen corresponding path program 1 times [2023-02-15 01:21:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:27,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161651272] [2023-02-15 01:21:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:27,180 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-15 01:21:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:27,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:21:27,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 01:21:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:27,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:21:27,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:27,252 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-15 01:21:27,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:27,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161651272] [2023-02-15 01:21:27,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161651272] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:27,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:27,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:21:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767639499] [2023-02-15 01:21:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:27,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:27,254 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:27,283 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-02-15 01:21:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:27,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 01:21:27,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:27,284 INFO L225 Difference]: With dead ends: 40 [2023-02-15 01:21:27,284 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 01:21:27,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:21:27,284 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:27,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 01:21:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-02-15 01:21:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 33 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-02-15 01:21:27,286 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2023-02-15 01:21:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:27,287 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-02-15 01:21:27,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-02-15 01:21:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:21:27,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:27,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:27,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:21:27,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:27,497 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1624534489, now seen corresponding path program 1 times [2023-02-15 01:21:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:27,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247612374] [2023-02-15 01:21:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:27,498 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-15 01:21:27,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:27,499 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-15 01:21:27,499 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-15 01:21:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:27,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:21:27,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:27,655 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-15 01:21:27,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:27,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:27,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247612374] [2023-02-15 01:21:27,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247612374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:27,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:27,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417223870] [2023-02-15 01:21:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:27,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:27,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:27,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:27,658 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:27,713 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-02-15 01:21:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:21:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 01:21:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:27,714 INFO L225 Difference]: With dead ends: 40 [2023-02-15 01:21:27,714 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 01:21:27,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:21:27,715 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:27,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 01:21:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2023-02-15 01:21:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 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-15 01:21:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-02-15 01:21:27,716 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 18 [2023-02-15 01:21:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:27,717 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-02-15 01:21:27,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2023-02-15 01:21:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 01:21:27,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:27,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:27,728 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-15 01:21:27,917 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-15 01:21:27,918 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1624534488, now seen corresponding path program 1 times [2023-02-15 01:21:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:27,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526812991] [2023-02-15 01:21:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:27,918 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-15 01:21:27,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:27,919 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-15 01:21:27,920 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-15 01:21:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:27,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:21:27,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:27,991 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-15 01:21:27,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:27,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:27,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526812991] [2023-02-15 01:21:27,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526812991] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:27,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:27,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58061383] [2023-02-15 01:21:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:27,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:21:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:21:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:27,993 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:28,031 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-02-15 01:21:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:21:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 01:21:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:28,032 INFO L225 Difference]: With dead ends: 35 [2023-02-15 01:21:28,032 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 01:21:28,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:21:28,033 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:28,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 01:21:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2023-02-15 01:21:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 31 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2023-02-15 01:21:28,035 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2023-02-15 01:21:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:28,035 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2023-02-15 01:21:28,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2023-02-15 01:21:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:21:28,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:28,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:28,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:21:28,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:28,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1567451378, now seen corresponding path program 1 times [2023-02-15 01:21:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:28,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359357837] [2023-02-15 01:21:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:28,243 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-15 01:21:28,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:28,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:21:28,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 01:21:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:28,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 01:21:28,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:34,485 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_70 (_ BitVec 1)) (|v_ULTIMATE.start_entry_point_~#a7~0#1.base_7| (_ BitVec 32)) (|ULTIMATE.start_probe1_6_~p~0#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a7~0#1.base_7| v_ArrVal_70))) (and (= (select .cse0 |ULTIMATE.start_probe1_6_~p~0#1.base|) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a7~0#1.base_7|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_probe1_6_~p~0#1.base| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a7~0#1.base_7| (_ bv0 1)))))) is different from true [2023-02-15 01:21:34,495 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-15 01:21:34,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:34,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:34,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359357837] [2023-02-15 01:21:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359357837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:34,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:21:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215427575] [2023-02-15 01:21:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:34,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:21:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:21:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=4, NotChecked=12, Total=72 [2023-02-15 01:21:34,497 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:36,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:21:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:36,659 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2023-02-15 01:21:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:21:36,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-15 01:21:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:36,659 INFO L225 Difference]: With dead ends: 38 [2023-02-15 01:21:36,659 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 01:21:36,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=4, NotChecked=14, Total=90 [2023-02-15 01:21:36,660 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:36,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 3 Unknown, 40 Unchecked, 2.1s Time] [2023-02-15 01:21:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 01:21:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-02-15 01:21:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-02-15 01:21:36,662 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2023-02-15 01:21:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:36,662 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-02-15 01:21:36,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-02-15 01:21:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:21:36,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:36,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:36,673 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 (14)] Ended with exit code 0 [2023-02-15 01:21:36,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:36,869 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1179038406, now seen corresponding path program 1 times [2023-02-15 01:21:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:36,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150912681] [2023-02-15 01:21:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:36,870 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-15 01:21:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:36,872 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-15 01:21:36,874 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-15 01:21:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:36,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 01:21:36,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:37,004 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-15 01:21:37,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:21:37,038 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-15 01:21:37,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:37,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:37,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150912681] [2023-02-15 01:21:37,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150912681] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:37,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:37,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:21:37,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764193442] [2023-02-15 01:21:37,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:37,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:21:37,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:37,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:21:37,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:21:37,040 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:37,127 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2023-02-15 01:21:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:21:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-02-15 01:21:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:37,128 INFO L225 Difference]: With dead ends: 32 [2023-02-15 01:21:37,128 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 01:21:37,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:21:37,128 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:37,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 128 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 01:21:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-02-15 01:21:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 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-15 01:21:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2023-02-15 01:21:37,130 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2023-02-15 01:21:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:37,130 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2023-02-15 01:21:37,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2023-02-15 01:21:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 01:21:37,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:37,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:37,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:21:37,331 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-15 01:21:37,331 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2104916282, now seen corresponding path program 1 times [2023-02-15 01:21:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:37,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574027918] [2023-02-15 01:21:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:37,332 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-15 01:21:37,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:37,333 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-15 01:21:37,334 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-15 01:21:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:37,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:21:37,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:37,412 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-15 01:21:37,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:37,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574027918] [2023-02-15 01:21:37,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574027918] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:37,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:37,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:21:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937842494] [2023-02-15 01:21:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:37,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:21:37,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:37,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:21:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:21:37,414 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:37,424 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2023-02-15 01:21:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:21:37,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-02-15 01:21:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:37,425 INFO L225 Difference]: With dead ends: 28 [2023-02-15 01:21:37,425 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 01:21:37,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:21:37,426 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:37,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:21:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 01:21:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 01:21:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 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-15 01:21:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2023-02-15 01:21:37,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 20 [2023-02-15 01:21:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:37,443 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2023-02-15 01:21:37,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2023-02-15 01:21:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 01:21:37,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:37,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:37,456 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-15 01:21:37,652 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-15 01:21:37,652 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2104515160, now seen corresponding path program 1 times [2023-02-15 01:21:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:37,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383893493] [2023-02-15 01:21:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:37,653 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-15 01:21:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:37,654 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-15 01:21:37,655 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-15 01:21:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:37,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 01:21:37,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:37,880 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-15 01:21:37,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 01:21:37,973 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-15 01:21:37,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:37,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:37,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383893493] [2023-02-15 01:21:37,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383893493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:37,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:37,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:21:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730925930] [2023-02-15 01:21:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:37,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:21:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:21:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:21:37,976 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:38,140 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2023-02-15 01:21:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:21:38,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-02-15 01:21:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:38,141 INFO L225 Difference]: With dead ends: 27 [2023-02-15 01:21:38,141 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 01:21:38,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:21:38,141 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:38,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:21:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 01:21:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-15 01:21:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 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-15 01:21:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2023-02-15 01:21:38,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 20 [2023-02-15 01:21:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:38,143 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2023-02-15 01:21:38,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2023-02-15 01:21:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 01:21:38,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:38,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:38,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 01:21:38,343 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-15 01:21:38,344 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 815460604, now seen corresponding path program 1 times [2023-02-15 01:21:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085272391] [2023-02-15 01:21:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:38,344 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-15 01:21:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:38,345 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-15 01:21:38,346 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-15 01:21:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:38,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:21:38,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:38,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 01:21:38,487 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-15 01:21:38,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:21:38,528 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-15 01:21:38,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:38,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:38,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085272391] [2023-02-15 01:21:38,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085272391] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:38,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:38,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:21:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782558375] [2023-02-15 01:21:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:38,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:21:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:21:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:21:38,530 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:38,651 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2023-02-15 01:21:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:21:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 01:21:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:38,652 INFO L225 Difference]: With dead ends: 26 [2023-02-15 01:21:38,652 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 01:21:38,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:21:38,652 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:38,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:21:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 01:21:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-15 01:21:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 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-15 01:21:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2023-02-15 01:21:38,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 21 [2023-02-15 01:21:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:38,654 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2023-02-15 01:21:38,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:21:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2023-02-15 01:21:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 01:21:38,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:21:38,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:38,663 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-15 01:21:38,854 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-15 01:21:38,855 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 8 more)] === [2023-02-15 01:21:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:21:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1750431677, now seen corresponding path program 1 times [2023-02-15 01:21:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:21:38,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826835306] [2023-02-15 01:21:38,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:21:38,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:38,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:21:38,857 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-15 01:21:38,859 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-15 01:21:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:21:38,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:21:38,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:21:39,133 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-15 01:21:39,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 01:21:48,039 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_134 (_ BitVec 1)) (|v_ULTIMATE.start_entry_point_~#a7~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_disconnect_6_#t~mem43#1.base_8| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a7~0#1.base_8| v_ArrVal_134))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a7~0#1.base_8|)) (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_disconnect_6_#t~mem43#1.base_8| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a7~0#1.base_8| (_ bv0 1))) (= (select .cse0 |v_ULTIMATE.start_disconnect_6_#t~mem43#1.base_8|) (_ bv0 1))))) is different from true [2023-02-15 01:21:48,046 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-15 01:21:48,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:21:48,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:21:48,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826835306] [2023-02-15 01:21:48,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826835306] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:21:48,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:21:48,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 01:21:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396962705] [2023-02-15 01:21:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:21:48,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:21:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:21:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:21:48,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=88, Unknown=5, NotChecked=18, Total=132 [2023-02-15 01:21:48,048 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 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-15 01:21:50,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:21:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:21:57,929 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2023-02-15 01:21:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:21:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-15 01:21:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:21:57,931 INFO L225 Difference]: With dead ends: 25 [2023-02-15 01:21:57,931 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 01:21:57,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=48, Invalid=159, Unknown=7, NotChecked=26, Total=240 [2023-02-15 01:21:57,931 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:21:57,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 82 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 1 Unknown, 31 Unchecked, 2.3s Time] [2023-02-15 01:21:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 01:21:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 01:21:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:21:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 01:21:57,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2023-02-15 01:21:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:21:57,933 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 01:21:57,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 11 states have internal predecessors, (23), 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-15 01:21:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 01:21:57,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 01:21:57,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2023-02-15 01:21:57,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (8 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (7 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (6 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (3 of 11 remaining) [2023-02-15 01:21:57,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (2 of 11 remaining) [2023-02-15 01:21:57,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (1 of 11 remaining) [2023-02-15 01:21:57,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2023-02-15 01:21:57,945 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-15 01:21:58,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:21:58,147 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:21:58,148 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 01:21:58,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:21:58 BoogieIcfgContainer [2023-02-15 01:21:58,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 01:21:58,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 01:21:58,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 01:21:58,151 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 01:21:58,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:21:23" (3/4) ... [2023-02-15 01:21:58,153 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 01:21:58,158 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-02-15 01:21:58,169 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-15 01:21:58,169 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 01:21:58,169 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 01:21:58,231 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 01:21:58,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 01:21:58,231 INFO L158 Benchmark]: Toolchain (without parser) took 35761.51ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 41.8MB in the beginning and 93.1MB in the end (delta: -51.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,232 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:21:58,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.10ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 32.7MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.10ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 30.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,232 INFO L158 Benchmark]: Boogie Preprocessor took 58.14ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 30.4MB in the beginning and 74.7MB in the end (delta: -44.3MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,232 INFO L158 Benchmark]: RCFGBuilder took 399.91ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 60.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,233 INFO L158 Benchmark]: TraceAbstraction took 34616.96ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 59.6MB in the beginning and 73.0MB in the end (delta: -13.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,233 INFO L158 Benchmark]: Witness Printer took 80.31ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 93.1MB in the end (delta: -20.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 01:21:58,234 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.10ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 32.7MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.10ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 30.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.14ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 30.4MB in the beginning and 74.7MB in the end (delta: -44.3MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * RCFGBuilder took 399.91ms. Allocated memory is still 96.5MB. Free memory was 74.7MB in the beginning and 60.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34616.96ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 59.6MB in the beginning and 73.0MB in the end (delta: -13.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 80.31ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 93.1MB in the end (delta: -20.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 777]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 790]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 1861 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 197 IncrementalHoareTripleChecker+Unchecked, 1285 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 576 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 98 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 277 ConstructedInterpolants, 48 QuantifiedInterpolants, 2222 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1175 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-02-15 01:21:58,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE