./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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_test23_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 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:37:54,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:37:54,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:37:54,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:37:54,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:37:54,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:37:54,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:37:54,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:37:54,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:37:54,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:37:54,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:37:54,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:37:54,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:37:54,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:37:54,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:37:54,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:37:54,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:37:54,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:37:54,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:37:54,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:37:54,635 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:37:54,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:37:54,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:37:54,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:37:54,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:37:54,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:37:54,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:37:54,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:37:54,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:37:54,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:37:54,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:37:54,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:37:54,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:37:54,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:37:54,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:37:54,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:37:54,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:37:54,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:37:54,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:37:54,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:37:54,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:37:54,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:37:54,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:37:54,691 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:37:54,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:37:54,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:37:54,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:37:54,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:37:54,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:37:54,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:37:54,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:37:54,694 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:37:54,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:37:54,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:37:54,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:37:54,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:37:54,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:37:54,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:37:54,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:37:54,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:37:54,696 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:37:54,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:37:54,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:37:54,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:37:54,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:37:54,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:37:54,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:37:54,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:37:54,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:37:54,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:37:54,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:37:54,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:37:54,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:37:54,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2022-07-14 06:37:54,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:37:54,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:37:54,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:37:54,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:37:54,969 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:37:54,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-14 06:37:55,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf3c2ba/0ae7826cbe16462dacd3cb594184259d/FLAG019ee8385 [2022-07-14 06:37:55,554 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:37:55,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-14 06:37:55,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf3c2ba/0ae7826cbe16462dacd3cb594184259d/FLAG019ee8385 [2022-07-14 06:37:55,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf3c2ba/0ae7826cbe16462dacd3cb594184259d [2022-07-14 06:37:55,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:37:55,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:37:55,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:37:55,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:37:55,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:37:55,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:37:55" (1/1) ... [2022-07-14 06:37:55,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f944a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:37:55, skipping insertion in model container [2022-07-14 06:37:55,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:37:55" (1/1) ... [2022-07-14 06:37:55,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:37:55,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:37:56,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:37:56,274 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions. at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.getConstantFirstDimensionOfArray(CTranslationUtil.java:210) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.constructIndexToInitInfo(InitializationHandler.java:1272) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.constructInitializerInfo(InitializationHandler.java:1228) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:806) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:212) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:628) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 06:37:56,279 INFO L158 Benchmark]: Toolchain (without parser) took 428.78ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.1MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 06:37:56,280 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 56.5MB in the beginning and 56.4MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:37:56,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.37ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 62.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 06:37:56,283 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.17ms. Allocated memory is still 81.8MB. Free memory was 56.5MB in the beginning and 56.4MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.37ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 62.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions. de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions.: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.getConstantFirstDimensionOfArray(CTranslationUtil.java:210) 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_test23_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 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:37:57,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:37:57,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:37:57,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:37:57,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:37:57,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:37:58,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:37:58,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:37:58,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:37:58,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:37:58,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:37:58,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:37:58,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:37:58,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:37:58,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:37:58,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:37:58,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:37:58,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:37:58,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:37:58,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:37:58,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:37:58,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:37:58,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:37:58,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:37:58,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:37:58,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:37:58,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:37:58,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:37:58,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:37:58,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:37:58,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:37:58,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:37:58,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:37:58,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:37:58,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:37:58,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:37:58,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:37:58,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:37:58,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:37:58,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:37:58,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:37:58,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:37:58,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:37:58,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:37:58,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:37:58,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:37:58,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:37:58,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:37:58,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:37:58,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:37:58,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:37:58,099 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:37:58,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:37:58,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:37:58,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:37:58,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:37:58,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:37:58,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:37:58,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:37:58,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:37:58,102 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:37:58,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:37:58,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:37:58,102 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:37:58,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:37:58,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:37:58,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:37:58,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:37:58,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:37:58,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:37:58,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:37:58,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:37:58,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:37:58,104 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:37:58,104 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:37:58,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:37:58,105 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2022-07-14 06:37:58,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:37:58,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:37:58,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:37:58,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:37:58,432 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:37:58,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-14 06:37:58,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbeaad4a/dd9369cb7c86463eac3a35e6ffc04a3d/FLAG3d0acb32b [2022-07-14 06:37:58,963 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:37:58,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2022-07-14 06:37:58,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbeaad4a/dd9369cb7c86463eac3a35e6ffc04a3d/FLAG3d0acb32b [2022-07-14 06:37:59,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbeaad4a/dd9369cb7c86463eac3a35e6ffc04a3d [2022-07-14 06:37:59,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:37:59,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:37:59,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:37:59,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:37:59,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:37:59,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:37:59" (1/1) ... [2022-07-14 06:37:59,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b277a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:37:59, skipping insertion in model container [2022-07-14 06:37:59,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:37:59" (1/1) ... [2022-07-14 06:37:59,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:37:59,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:37:59,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:37:59,821 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 06:37:59,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:37:59,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:37:59,891 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:37:59,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:38:00,001 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:38:00,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00 WrapperNode [2022-07-14 06:38:00,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:38:00,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:38:00,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:38:00,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:38:00,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,080 INFO L137 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 195 [2022-07-14 06:38:00,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:38:00,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:38:00,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:38:00,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:38:00,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:38:00,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:38:00,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:38:00,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:38:00,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (1/1) ... [2022-07-14 06:38:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:38:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:38:00,165 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) [2022-07-14 06:38:00,179 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 [2022-07-14 06:38:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:38:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-14 06:38:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-14 06:38:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2022-07-14 06:38:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2022-07-14 06:38:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 06:38:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 06:38:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:38:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:38:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2022-07-14 06:38:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2022-07-14 06:38:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:38:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:38:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:38:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:38:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:38:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:38:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2022-07-14 06:38:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2022-07-14 06:38:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 06:38:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 06:38:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:38:00,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:38:00,351 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:38:00,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:38:00,951 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:38:00,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:38:00,958 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:38:00,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:38:00 BoogieIcfgContainer [2022-07-14 06:38:00,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:38:00,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:38:00,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:38:00,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:38:00,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:37:59" (1/3) ... [2022-07-14 06:38:00,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b49beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:38:00, skipping insertion in model container [2022-07-14 06:38:00,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:38:00" (2/3) ... [2022-07-14 06:38:00,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b49beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:38:00, skipping insertion in model container [2022-07-14 06:38:00,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:38:00" (3/3) ... [2022-07-14 06:38:00,966 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2022-07-14 06:38:00,978 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:38:00,979 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2022-07-14 06:38:01,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:38:01,049 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d70c37, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52de14f0 [2022-07-14 06:38:01,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2022-07-14 06:38:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:38:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:38:01,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:01,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:01,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1281397623, now seen corresponding path program 1 times [2022-07-14 06:38:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:01,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229895347] [2022-07-14 06:38:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:01,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:01,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:01,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:01,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:38:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:01,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:38:01,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:01,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:01,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:01,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:01,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229895347] [2022-07-14 06:38:01,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229895347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:01,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:01,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481206446] [2022-07-14 06:38:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:38:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:38:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:01,342 INFO L87 Difference]: Start difference. First operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:38:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:02,009 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2022-07-14 06:38:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:38:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-14 06:38:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:02,019 INFO L225 Difference]: With dead ends: 231 [2022-07-14 06:38:02,019 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 06:38:02,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:38:02,023 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 28 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:02,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 839 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:38:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 06:38:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2022-07-14 06:38:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.793103448275862) internal successors, (208), 194 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-14 06:38:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 227 transitions. [2022-07-14 06:38:02,066 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 227 transitions. Word has length 12 [2022-07-14 06:38:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:02,067 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 227 transitions. [2022-07-14 06:38:02,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:38:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 227 transitions. [2022-07-14 06:38:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:38:02,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:02,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:02,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:02,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:02,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1281397624, now seen corresponding path program 1 times [2022-07-14 06:38:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:02,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552067793] [2022-07-14 06:38:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:02,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:02,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:02,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:38:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:02,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:38:02,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:02,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:02,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:02,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552067793] [2022-07-14 06:38:02,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552067793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:02,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:02,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:38:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529374402] [2022-07-14 06:38:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:02,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:38:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:02,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:38:02,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:38:02,516 INFO L87 Difference]: Start difference. First operand 211 states and 227 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:38:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:03,259 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2022-07-14 06:38:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:38:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-14 06:38:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:03,261 INFO L225 Difference]: With dead ends: 236 [2022-07-14 06:38:03,261 INFO L226 Difference]: Without dead ends: 236 [2022-07-14 06:38:03,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:38:03,262 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 35 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:03,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1152 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:38:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-14 06:38:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 211. [2022-07-14 06:38:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.7758620689655173) internal successors, (206), 194 states have internal predecessors, (206), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-14 06:38:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2022-07-14 06:38:03,273 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 12 [2022-07-14 06:38:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:03,273 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2022-07-14 06:38:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:38:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2022-07-14 06:38:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:38:03,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:03,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:03,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:03,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1270759338, now seen corresponding path program 1 times [2022-07-14 06:38:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:03,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660793922] [2022-07-14 06:38:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:03,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:03,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:03,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:03,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:38:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:03,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:38:03,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:03,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:03,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:03,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660793922] [2022-07-14 06:38:03,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660793922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:03,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:03,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329694533] [2022-07-14 06:38:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:03,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:38:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:38:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:03,607 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:38:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:03,641 INFO L93 Difference]: Finished difference Result 223 states and 237 transitions. [2022-07-14 06:38:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:38:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-14 06:38:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:03,643 INFO L225 Difference]: With dead ends: 223 [2022-07-14 06:38:03,643 INFO L226 Difference]: Without dead ends: 223 [2022-07-14 06:38:03,643 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 [2022-07-14 06:38:03,644 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 20 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:03,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 836 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-14 06:38:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2022-07-14 06:38:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 186 states have internal predecessors, (198), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-14 06:38:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2022-07-14 06:38:03,655 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 12 [2022-07-14 06:38:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:03,656 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2022-07-14 06:38:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:38:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2022-07-14 06:38:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:38:03,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:03,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:03,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:03,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:03,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1281312215, now seen corresponding path program 1 times [2022-07-14 06:38:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282757884] [2022-07-14 06:38:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:03,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:03,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:03,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:38:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:03,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:38:03,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:03,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:03,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:03,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282757884] [2022-07-14 06:38:03,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282757884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:03,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:03,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181690954] [2022-07-14 06:38:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:03,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:38:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:38:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:03,955 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. 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) [2022-07-14 06:38:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:03,992 INFO L93 Difference]: Finished difference Result 223 states and 236 transitions. [2022-07-14 06:38:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:38:03,992 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 [2022-07-14 06:38:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:03,993 INFO L225 Difference]: With dead ends: 223 [2022-07-14 06:38:03,994 INFO L226 Difference]: Without dead ends: 223 [2022-07-14 06:38:03,994 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 [2022-07-14 06:38:03,994 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 127 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:03,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 768 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-14 06:38:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2022-07-14 06:38:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 186 states have internal predecessors, (197), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-14 06:38:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2022-07-14 06:38:04,015 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 12 [2022-07-14 06:38:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:04,016 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2022-07-14 06:38:04,016 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) [2022-07-14 06:38:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2022-07-14 06:38:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:38:04,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:04,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:04,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:04,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1270844746, now seen corresponding path program 1 times [2022-07-14 06:38:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:04,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198688916] [2022-07-14 06:38:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:04,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:04,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:38:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:04,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:38:04,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:04,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:04,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:04,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198688916] [2022-07-14 06:38:04,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198688916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:04,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:04,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294125131] [2022-07-14 06:38:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:04,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:38:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:38:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:04,311 INFO L87 Difference]: Start difference. First operand 202 states and 214 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) [2022-07-14 06:38:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:04,342 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2022-07-14 06:38:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:38:04,360 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 [2022-07-14 06:38:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:04,361 INFO L225 Difference]: With dead ends: 207 [2022-07-14 06:38:04,361 INFO L226 Difference]: Without dead ends: 207 [2022-07-14 06:38:04,362 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 [2022-07-14 06:38:04,362 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 110 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:04,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 720 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-14 06:38:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2022-07-14 06:38:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 188 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-14 06:38:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2022-07-14 06:38:04,370 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 12 [2022-07-14 06:38:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:04,371 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2022-07-14 06:38:04,371 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) [2022-07-14 06:38:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2022-07-14 06:38:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:38:04,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:04,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:04,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:04,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:04,581 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -741461350, now seen corresponding path program 1 times [2022-07-14 06:38:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:04,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991925522] [2022-07-14 06:38:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:04,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:04,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:04,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:04,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:38:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:04,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:38:04,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:04,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:04,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:04,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991925522] [2022-07-14 06:38:04,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991925522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:04,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:04,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:38:04,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385641646] [2022-07-14 06:38:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:38:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:38:04,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:38:04,660 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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) [2022-07-14 06:38:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:04,958 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2022-07-14 06:38:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:38:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 [2022-07-14 06:38:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:04,959 INFO L225 Difference]: With dead ends: 216 [2022-07-14 06:38:04,959 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 06:38:04,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:38:04,961 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 51 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:04,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 396 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:38:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 06:38:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2022-07-14 06:38:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 183 states have internal predecessors, (193), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:38:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2022-07-14 06:38:04,967 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 13 [2022-07-14 06:38:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:04,967 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2022-07-14 06:38:04,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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) [2022-07-14 06:38:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2022-07-14 06:38:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:38:04,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:04,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:04,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-14 06:38:05,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:05,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 980413121, now seen corresponding path program 1 times [2022-07-14 06:38:05,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:05,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265113196] [2022-07-14 06:38:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:05,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:05,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:05,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:05,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:38:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:05,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:38:05,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:05,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:05,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:38:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:05,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:05,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265113196] [2022-07-14 06:38:05,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265113196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:05,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:05,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587321584] [2022-07-14 06:38:05,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:05,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:38:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:38:05,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:38:05,425 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:38:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:08,310 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2022-07-14 06:38:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:38:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-14 06:38:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:08,312 INFO L225 Difference]: With dead ends: 208 [2022-07-14 06:38:08,312 INFO L226 Difference]: Without dead ends: 208 [2022-07-14 06:38:08,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2022-07-14 06:38:08,313 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 58 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:08,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 576 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 490 Invalid, 0 Unknown, 113 Unchecked, 0.8s Time] [2022-07-14 06:38:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-14 06:38:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2022-07-14 06:38:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 109 states have (on average 1.761467889908257) internal successors, (192), 182 states have internal predecessors, (192), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:38:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 208 transitions. [2022-07-14 06:38:08,318 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 208 transitions. Word has length 16 [2022-07-14 06:38:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:08,318 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 208 transitions. [2022-07-14 06:38:08,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:38:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 208 transitions. [2022-07-14 06:38:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:38:08,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:08,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:08,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:08,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:08,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 980413120, now seen corresponding path program 1 times [2022-07-14 06:38:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:08,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832565146] [2022-07-14 06:38:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:08,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:08,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:08,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:08,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:38:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:08,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:38:08,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:08,702 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:38:08,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 06:38:08,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:08,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:08,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:08,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832565146] [2022-07-14 06:38:08,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832565146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:08,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:08,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:08,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115036880] [2022-07-14 06:38:08,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:08,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:38:08,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:08,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:38:08,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:08,747 INFO L87 Difference]: Start difference. First operand 197 states and 208 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:38:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:09,277 INFO L93 Difference]: Finished difference Result 249 states and 263 transitions. [2022-07-14 06:38:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:38:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-07-14 06:38:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:09,279 INFO L225 Difference]: With dead ends: 249 [2022-07-14 06:38:09,279 INFO L226 Difference]: Without dead ends: 249 [2022-07-14 06:38:09,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:38:09,280 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 199 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:09,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 538 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 366 Invalid, 0 Unknown, 114 Unchecked, 0.5s Time] [2022-07-14 06:38:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-14 06:38:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2022-07-14 06:38:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 191 states have internal predecessors, (206), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-14 06:38:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2022-07-14 06:38:09,286 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 16 [2022-07-14 06:38:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:09,286 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2022-07-14 06:38:09,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:38:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2022-07-14 06:38:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:38:09,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:09,287 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] [2022-07-14 06:38:09,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:09,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:09,488 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1929045948, now seen corresponding path program 1 times [2022-07-14 06:38:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:09,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313150509] [2022-07-14 06:38:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:09,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:09,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:38:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:09,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:38:09,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:09,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:09,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:09,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:09,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313150509] [2022-07-14 06:38:09,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313150509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:09,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:09,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355576624] [2022-07-14 06:38:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:09,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:38:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:38:09,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:38:09,628 INFO L87 Difference]: Start difference. First operand 207 states and 224 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:10,178 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2022-07-14 06:38:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:38:10,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-07-14 06:38:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:10,180 INFO L225 Difference]: With dead ends: 262 [2022-07-14 06:38:10,180 INFO L226 Difference]: Without dead ends: 262 [2022-07-14 06:38:10,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:10,181 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 69 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:10,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 643 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:38:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-14 06:38:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 234. [2022-07-14 06:38:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 147 states have (on average 1.7687074829931972) internal successors, (260), 218 states have internal predecessors, (260), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-14 06:38:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2022-07-14 06:38:10,188 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 25 [2022-07-14 06:38:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:10,188 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2022-07-14 06:38:10,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2022-07-14 06:38:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:38:10,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:10,189 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] [2022-07-14 06:38:10,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:10,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:10,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:10,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1929045947, now seen corresponding path program 1 times [2022-07-14 06:38:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:10,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175408626] [2022-07-14 06:38:10,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:10,398 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:38:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:10,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:38:10,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:10,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:10,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:10,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:10,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175408626] [2022-07-14 06:38:10,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175408626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:10,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:10,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:10,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947994768] [2022-07-14 06:38:10,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:10,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:38:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:38:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:38:10,569 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:11,233 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2022-07-14 06:38:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:38:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-07-14 06:38:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:11,235 INFO L225 Difference]: With dead ends: 294 [2022-07-14 06:38:11,235 INFO L226 Difference]: Without dead ends: 294 [2022-07-14 06:38:11,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:11,235 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 103 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:11,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 641 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:38:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-14 06:38:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 236. [2022-07-14 06:38:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.7466666666666666) internal successors, (262), 219 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2022-07-14 06:38:11,242 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2022-07-14 06:38:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:11,243 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2022-07-14 06:38:11,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2022-07-14 06:38:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:38:11,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:11,243 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, 1, 1] [2022-07-14 06:38:11,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:11,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:11,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1612783879, now seen corresponding path program 1 times [2022-07-14 06:38:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:11,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968911813] [2022-07-14 06:38:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:11,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:11,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:11,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:38:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:11,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:38:11,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:11,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:11,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:11,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968911813] [2022-07-14 06:38:11,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968911813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:11,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:11,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:11,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175722021] [2022-07-14 06:38:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:11,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:38:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:38:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:38:11,568 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:11,650 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2022-07-14 06:38:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:38:11,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-07-14 06:38:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:11,653 INFO L225 Difference]: With dead ends: 236 [2022-07-14 06:38:11,653 INFO L226 Difference]: Without dead ends: 236 [2022-07-14 06:38:11,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:11,654 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 118 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:11,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 824 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:38:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-14 06:38:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-14 06:38:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.74) internal successors, (261), 219 states have internal predecessors, (261), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2022-07-14 06:38:11,661 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 27 [2022-07-14 06:38:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:11,661 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2022-07-14 06:38:11,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2022-07-14 06:38:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:38:11,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:11,665 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:11,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:11,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:11,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -405984592, now seen corresponding path program 1 times [2022-07-14 06:38:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:11,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885116877] [2022-07-14 06:38:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:11,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:11,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:11,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:38:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:12,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:38:12,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:12,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:12,086 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:38:12,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-14 06:38:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:12,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:12,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:12,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885116877] [2022-07-14 06:38:12,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885116877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:12,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:12,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:38:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875724412] [2022-07-14 06:38:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:12,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:38:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:12,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:38:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:38:12,141 INFO L87 Difference]: Start difference. First operand 236 states and 282 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:38:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:12,815 INFO L93 Difference]: Finished difference Result 248 states and 290 transitions. [2022-07-14 06:38:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:38:12,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-07-14 06:38:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:12,817 INFO L225 Difference]: With dead ends: 248 [2022-07-14 06:38:12,817 INFO L226 Difference]: Without dead ends: 248 [2022-07-14 06:38:12,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:38:12,818 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 197 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:12,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 542 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:38:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-14 06:38:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 231. [2022-07-14 06:38:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 214 states have internal predecessors, (251), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2022-07-14 06:38:12,824 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 33 [2022-07-14 06:38:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:12,825 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2022-07-14 06:38:12,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:38:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2022-07-14 06:38:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:38:12,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:12,826 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:12,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:13,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:13,037 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -405984591, now seen corresponding path program 1 times [2022-07-14 06:38:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:13,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178845830] [2022-07-14 06:38:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:13,040 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:13,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:38:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:13,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:38:13,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:13,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:13,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:13,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:38:13,266 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:38:13,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:38:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:13,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:13,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:13,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178845830] [2022-07-14 06:38:13,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178845830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:13,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:13,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837625777] [2022-07-14 06:38:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:13,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:38:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:38:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:13,344 INFO L87 Difference]: Start difference. First operand 231 states and 272 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:38:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:14,224 INFO L93 Difference]: Finished difference Result 308 states and 337 transitions. [2022-07-14 06:38:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:38:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-07-14 06:38:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:14,229 INFO L225 Difference]: With dead ends: 308 [2022-07-14 06:38:14,229 INFO L226 Difference]: Without dead ends: 308 [2022-07-14 06:38:14,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:38:14,230 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:14,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 548 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 502 Invalid, 0 Unknown, 150 Unchecked, 0.8s Time] [2022-07-14 06:38:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-14 06:38:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 231. [2022-07-14 06:38:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.64) internal successors, (246), 214 states have internal predecessors, (246), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2022-07-14 06:38:14,236 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 33 [2022-07-14 06:38:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:14,237 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2022-07-14 06:38:14,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:38:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2022-07-14 06:38:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:38:14,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:14,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:14,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:14,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:14,439 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -60324907, now seen corresponding path program 1 times [2022-07-14 06:38:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:14,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859368819] [2022-07-14 06:38:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:14,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:14,441 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:14,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:38:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:14,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:38:14,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:14,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:14,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:14,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859368819] [2022-07-14 06:38:14,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859368819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:14,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:14,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433367327] [2022-07-14 06:38:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:14,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:38:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:38:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:38:14,899 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:38:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:14,932 INFO L93 Difference]: Finished difference Result 315 states and 355 transitions. [2022-07-14 06:38:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:38:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-07-14 06:38:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:14,934 INFO L225 Difference]: With dead ends: 315 [2022-07-14 06:38:14,934 INFO L226 Difference]: Without dead ends: 315 [2022-07-14 06:38:14,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:38:14,935 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 142 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:14,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 553 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-07-14 06:38:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-14 06:38:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 248. [2022-07-14 06:38:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 166 states have (on average 1.5903614457831325) internal successors, (264), 230 states have internal predecessors, (264), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 285 transitions. [2022-07-14 06:38:14,941 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 285 transitions. Word has length 36 [2022-07-14 06:38:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:14,942 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 285 transitions. [2022-07-14 06:38:14,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:38:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 285 transitions. [2022-07-14 06:38:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:38:14,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:14,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:14,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:15,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:15,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -60324935, now seen corresponding path program 1 times [2022-07-14 06:38:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:15,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357134258] [2022-07-14 06:38:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:15,156 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:15,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:38:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:15,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:38:15,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:15,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:15,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357134258] [2022-07-14 06:38:15,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357134258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:15,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:15,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:38:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772905718] [2022-07-14 06:38:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:15,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:38:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:38:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:38:15,291 INFO L87 Difference]: Start difference. First operand 248 states and 285 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:15,308 INFO L93 Difference]: Finished difference Result 294 states and 335 transitions. [2022-07-14 06:38:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:38:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-14 06:38:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:15,310 INFO L225 Difference]: With dead ends: 294 [2022-07-14 06:38:15,310 INFO L226 Difference]: Without dead ends: 294 [2022-07-14 06:38:15,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:15,311 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 36 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:15,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 583 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-14 06:38:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 254. [2022-07-14 06:38:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 172 states have (on average 1.569767441860465) internal successors, (270), 236 states have internal predecessors, (270), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2022-07-14 06:38:15,318 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 36 [2022-07-14 06:38:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:15,318 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2022-07-14 06:38:15,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2022-07-14 06:38:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:38:15,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:15,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:15,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:15,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:15,535 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1290023480, now seen corresponding path program 1 times [2022-07-14 06:38:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:15,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265426049] [2022-07-14 06:38:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:15,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:15,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:15,538 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:15,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:38:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:15,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:38:15,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:15,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:15,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:15,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265426049] [2022-07-14 06:38:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265426049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:15,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:15,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:38:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301996677] [2022-07-14 06:38:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:15,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:38:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:38:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:38:15,659 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:15,683 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2022-07-14 06:38:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:38:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-14 06:38:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:15,686 INFO L225 Difference]: With dead ends: 277 [2022-07-14 06:38:15,686 INFO L226 Difference]: Without dead ends: 277 [2022-07-14 06:38:15,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:15,689 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 43 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:15,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 581 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-14 06:38:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2022-07-14 06:38:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 174 states have (on average 1.5632183908045978) internal successors, (272), 238 states have internal predecessors, (272), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 293 transitions. [2022-07-14 06:38:15,697 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 293 transitions. Word has length 40 [2022-07-14 06:38:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:15,700 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 293 transitions. [2022-07-14 06:38:15,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 293 transitions. [2022-07-14 06:38:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:38:15,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:15,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:15,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:15,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:15,913 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1533058511, now seen corresponding path program 1 times [2022-07-14 06:38:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434953057] [2022-07-14 06:38:15,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:15,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:15,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:15,915 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:15,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:38:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:16,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:38:16,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:16,180 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:38:16,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:38:16,406 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:38:16,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-07-14 06:38:16,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-14 06:38:16,576 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:38:16,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-14 06:38:16,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:16,975 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:38:16,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 28 [2022-07-14 06:38:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:17,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:17,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434953057] [2022-07-14 06:38:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434953057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:17,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:17,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 06:38:17,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107662292] [2022-07-14 06:38:17,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:17,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:38:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:17,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:38:17,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:38:17,227 INFO L87 Difference]: Start difference. First operand 256 states and 293 transitions. Second operand has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:17,623 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2022-07-14 06:38:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:38:17,624 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-07-14 06:38:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:17,625 INFO L225 Difference]: With dead ends: 268 [2022-07-14 06:38:17,625 INFO L226 Difference]: Without dead ends: 268 [2022-07-14 06:38:17,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:38:17,625 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 19 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:17,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1553 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 526 Unchecked, 0.4s Time] [2022-07-14 06:38:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-14 06:38:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-07-14 06:38:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 182 states have (on average 1.5494505494505495) internal successors, (282), 246 states have internal predecessors, (282), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 303 transitions. [2022-07-14 06:38:17,631 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 303 transitions. Word has length 42 [2022-07-14 06:38:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:17,631 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 303 transitions. [2022-07-14 06:38:17,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 303 transitions. [2022-07-14 06:38:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:38:17,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:17,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:17,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-14 06:38:17,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:17,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1533058512, now seen corresponding path program 1 times [2022-07-14 06:38:17,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:17,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747687310] [2022-07-14 06:38:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:17,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:17,845 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:17,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:38:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:18,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-14 06:38:18,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:18,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:18,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:38:18,139 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:38:18,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:38:18,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:18,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:38:18,464 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:38:18,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:18,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:18,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747687310] [2022-07-14 06:38:18,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747687310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:18,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:18,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:38:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439225315] [2022-07-14 06:38:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:18,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:38:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:38:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:38:18,627 INFO L87 Difference]: Start difference. First operand 264 states and 303 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:19,596 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2022-07-14 06:38:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:38:19,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-07-14 06:38:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:19,598 INFO L225 Difference]: With dead ends: 272 [2022-07-14 06:38:19,598 INFO L226 Difference]: Without dead ends: 272 [2022-07-14 06:38:19,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:38:19,598 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 293 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:19,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 730 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 670 Invalid, 0 Unknown, 276 Unchecked, 0.8s Time] [2022-07-14 06:38:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-14 06:38:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2022-07-14 06:38:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 182 states have (on average 1.532967032967033) internal successors, (279), 244 states have internal predecessors, (279), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 300 transitions. [2022-07-14 06:38:19,612 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 300 transitions. Word has length 42 [2022-07-14 06:38:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:19,613 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 300 transitions. [2022-07-14 06:38:19,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 300 transitions. [2022-07-14 06:38:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:38:19,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:19,614 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:19,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:19,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:19,823 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -974113632, now seen corresponding path program 1 times [2022-07-14 06:38:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:19,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880221618] [2022-07-14 06:38:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:19,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:19,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:19,826 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:19,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 06:38:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:20,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:38:20,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:20,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2022-07-14 06:38:20,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2022-07-14 06:38:20,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:20,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2022-07-14 06:38:20,255 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-14 06:38:20,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 50 [2022-07-14 06:38:20,276 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-14 06:38:20,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 14 [2022-07-14 06:38:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:20,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:20,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880221618] [2022-07-14 06:38:20,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880221618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:20,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:20,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:38:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084017008] [2022-07-14 06:38:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:38:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:38:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:38:20,419 INFO L87 Difference]: Start difference. First operand 262 states and 300 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:20,609 INFO L93 Difference]: Finished difference Result 270 states and 308 transitions. [2022-07-14 06:38:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:38:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-14 06:38:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:20,611 INFO L225 Difference]: With dead ends: 270 [2022-07-14 06:38:20,611 INFO L226 Difference]: Without dead ends: 270 [2022-07-14 06:38:20,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:20,612 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 28 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:20,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 863 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2022-07-14 06:38:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-14 06:38:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 261. [2022-07-14 06:38:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 182 states have (on average 1.521978021978022) internal successors, (277), 243 states have internal predecessors, (277), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions. [2022-07-14 06:38:20,617 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 43 [2022-07-14 06:38:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:20,618 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 298 transitions. [2022-07-14 06:38:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2022-07-14 06:38:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:38:20,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:20,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:20,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:20,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:20,831 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 280193697, now seen corresponding path program 1 times [2022-07-14 06:38:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362952579] [2022-07-14 06:38:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:20,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:20,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:20,834 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:20,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:38:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:20,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:38:20,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:20,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:20,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:20,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362952579] [2022-07-14 06:38:20,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362952579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:20,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:20,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:38:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064951948] [2022-07-14 06:38:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:20,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:38:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:20,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:38:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:38:20,972 INFO L87 Difference]: Start difference. First operand 261 states and 298 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:20,989 INFO L93 Difference]: Finished difference Result 283 states and 319 transitions. [2022-07-14 06:38:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:38:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-14 06:38:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:20,991 INFO L225 Difference]: With dead ends: 283 [2022-07-14 06:38:20,991 INFO L226 Difference]: Without dead ends: 283 [2022-07-14 06:38:20,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:20,992 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 48 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:20,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 561 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-14 06:38:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2022-07-14 06:38:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 184 states have (on average 1.5108695652173914) internal successors, (278), 245 states have internal predecessors, (278), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 299 transitions. [2022-07-14 06:38:20,998 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 299 transitions. Word has length 43 [2022-07-14 06:38:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:20,999 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 299 transitions. [2022-07-14 06:38:20,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 299 transitions. [2022-07-14 06:38:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:38:21,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:21,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:21,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-14 06:38:21,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:21,210 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -132751331, now seen corresponding path program 1 times [2022-07-14 06:38:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:21,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179037417] [2022-07-14 06:38:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:21,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:21,212 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:21,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:38:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:21,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:38:21,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:21,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:21,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:21,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179037417] [2022-07-14 06:38:21,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179037417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:21,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:21,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224335658] [2022-07-14 06:38:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:21,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:38:21,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:38:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:21,482 INFO L87 Difference]: Start difference. First operand 263 states and 299 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:22,092 INFO L93 Difference]: Finished difference Result 311 states and 340 transitions. [2022-07-14 06:38:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:38:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-14 06:38:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:22,094 INFO L225 Difference]: With dead ends: 311 [2022-07-14 06:38:22,094 INFO L226 Difference]: Without dead ends: 311 [2022-07-14 06:38:22,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:38:22,095 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 126 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:22,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 818 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:38:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-14 06:38:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2022-07-14 06:38:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 184 states have (on average 1.4945652173913044) internal successors, (275), 244 states have internal predecessors, (275), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 296 transitions. [2022-07-14 06:38:22,102 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 296 transitions. Word has length 44 [2022-07-14 06:38:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:22,102 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 296 transitions. [2022-07-14 06:38:22,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 296 transitions. [2022-07-14 06:38:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:38:22,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:22,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:22,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:22,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:22,316 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash -132751330, now seen corresponding path program 1 times [2022-07-14 06:38:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:22,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154987074] [2022-07-14 06:38:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:22,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:22,319 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:22,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:38:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:22,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:38:22,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:22,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:22,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:22,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:22,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154987074] [2022-07-14 06:38:22,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154987074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:22,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:22,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:38:22,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029471566] [2022-07-14 06:38:22,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:22,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:38:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:22,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:38:22,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:38:22,645 INFO L87 Difference]: Start difference. First operand 262 states and 296 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:23,420 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2022-07-14 06:38:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:38:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-14 06:38:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:23,424 INFO L225 Difference]: With dead ends: 331 [2022-07-14 06:38:23,424 INFO L226 Difference]: Without dead ends: 331 [2022-07-14 06:38:23,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:38:23,425 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 142 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:23,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 840 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:38:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-14 06:38:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 262. [2022-07-14 06:38:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 184 states have (on average 1.483695652173913) internal successors, (273), 244 states have internal predecessors, (273), 9 states have call successors, (9), 8 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:38:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 294 transitions. [2022-07-14 06:38:23,430 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 294 transitions. Word has length 44 [2022-07-14 06:38:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:23,431 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 294 transitions. [2022-07-14 06:38:23,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 294 transitions. [2022-07-14 06:38:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:38:23,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:23,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:23,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:23,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:23,650 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:23,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1335876523, now seen corresponding path program 1 times [2022-07-14 06:38:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:23,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467451211] [2022-07-14 06:38:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:23,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:23,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:23,652 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:23,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:38:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:23,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:38:23,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:23,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:23,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:24,035 INFO L356 Elim1Store]: treesize reduction 54, result has 37.9 percent of original size [2022-07-14 06:38:24,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 47 [2022-07-14 06:38:24,084 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:38:24,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 06:38:24,386 INFO L356 Elim1Store]: treesize reduction 54, result has 37.9 percent of original size [2022-07-14 06:38:24,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2022-07-14 06:38:24,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 06:38:24,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 06:38:25,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:25,226 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:38:25,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 35 [2022-07-14 06:38:25,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:38:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:25,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:25,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:25,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467451211] [2022-07-14 06:38:25,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467451211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:25,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:25,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-14 06:38:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357111226] [2022-07-14 06:38:25,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:25,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 06:38:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 06:38:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:38:25,454 INFO L87 Difference]: Start difference. First operand 262 states and 294 transitions. Second operand has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:26,311 INFO L93 Difference]: Finished difference Result 301 states and 336 transitions. [2022-07-14 06:38:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:38:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-07-14 06:38:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:26,312 INFO L225 Difference]: With dead ends: 301 [2022-07-14 06:38:26,312 INFO L226 Difference]: Without dead ends: 301 [2022-07-14 06:38:26,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:38:26,313 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 85 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:26,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1318 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 511 Invalid, 0 Unknown, 509 Unchecked, 0.5s Time] [2022-07-14 06:38:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-14 06:38:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 271. [2022-07-14 06:38:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.486910994764398) internal successors, (284), 252 states have internal predecessors, (284), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 308 transitions. [2022-07-14 06:38:26,319 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 308 transitions. Word has length 45 [2022-07-14 06:38:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:26,319 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 308 transitions. [2022-07-14 06:38:26,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 308 transitions. [2022-07-14 06:38:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:38:26,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:26,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:26,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:26,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:26,531 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1335876522, now seen corresponding path program 1 times [2022-07-14 06:38:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:26,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42586670] [2022-07-14 06:38:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:26,533 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:26,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:38:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:26,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-14 06:38:26,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:26,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:26,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:27,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:27,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:27,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:27,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:38:27,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:27,210 INFO L356 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2022-07-14 06:38:27,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2022-07-14 06:38:27,295 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:38:27,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 06:38:27,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-14 06:38:27,642 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:38:27,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:38:27,680 INFO L356 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-07-14 06:38:27,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:38:27,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:27,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-14 06:38:28,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:28,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-14 06:38:28,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:28,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-14 06:38:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:28,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:28,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:28,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42586670] [2022-07-14 06:38:28,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42586670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:28,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:28,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-14 06:38:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759124111] [2022-07-14 06:38:28,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:28,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:38:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:28,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:38:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:38:28,731 INFO L87 Difference]: Start difference. First operand 271 states and 308 transitions. Second operand has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:29,131 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2022-07-14 06:38:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:38:29,132 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-07-14 06:38:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:29,133 INFO L225 Difference]: With dead ends: 272 [2022-07-14 06:38:29,133 INFO L226 Difference]: Without dead ends: 272 [2022-07-14 06:38:29,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:38:29,134 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 24 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:29,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1605 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 891 Unchecked, 0.3s Time] [2022-07-14 06:38:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-14 06:38:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2022-07-14 06:38:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.4816753926701571) internal successors, (283), 252 states have internal predecessors, (283), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 307 transitions. [2022-07-14 06:38:29,141 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 307 transitions. Word has length 45 [2022-07-14 06:38:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:29,141 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 307 transitions. [2022-07-14 06:38:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 307 transitions. [2022-07-14 06:38:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:38:29,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:29,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:29,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-14 06:38:29,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:29,353 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:29,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash 417882070, now seen corresponding path program 1 times [2022-07-14 06:38:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:29,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235245704] [2022-07-14 06:38:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:29,355 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:29,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:38:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:29,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 06:38:29,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:29,703 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-14 06:38:29,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-14 06:38:29,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:30,130 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:38:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:38:30,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:38:30,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:30,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:30,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:30,499 INFO L356 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2022-07-14 06:38:30,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 58 [2022-07-14 06:38:30,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:38:30,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-07-14 06:38:30,955 INFO L356 Elim1Store]: treesize reduction 13, result has 68.3 percent of original size [2022-07-14 06:38:30,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 54 [2022-07-14 06:38:31,211 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:38:31,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2022-07-14 06:38:31,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:31,342 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:38:31,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 45 [2022-07-14 06:38:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:31,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:32,068 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:38:32,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-07-14 06:38:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:32,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:32,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:32,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235245704] [2022-07-14 06:38:32,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235245704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:32,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:32,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-07-14 06:38:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468918458] [2022-07-14 06:38:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:32,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:38:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:32,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:38:32,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:38:32,269 INFO L87 Difference]: Start difference. First operand 271 states and 307 transitions. Second operand has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:33,053 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2022-07-14 06:38:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:38:33,054 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-14 06:38:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:33,055 INFO L225 Difference]: With dead ends: 271 [2022-07-14 06:38:33,055 INFO L226 Difference]: Without dead ends: 271 [2022-07-14 06:38:33,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:38:33,056 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 16 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:33,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2147 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 371 Invalid, 0 Unknown, 716 Unchecked, 0.5s Time] [2022-07-14 06:38:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-14 06:38:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-07-14 06:38:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.4764397905759161) internal successors, (282), 252 states have internal predecessors, (282), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 306 transitions. [2022-07-14 06:38:33,061 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 306 transitions. Word has length 47 [2022-07-14 06:38:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:33,061 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 306 transitions. [2022-07-14 06:38:33,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 306 transitions. [2022-07-14 06:38:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:38:33,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:33,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:33,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:33,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:33,274 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting free_reportsErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:33,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash 417882071, now seen corresponding path program 1 times [2022-07-14 06:38:33,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:33,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143621351] [2022-07-14 06:38:33,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:33,276 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:33,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 06:38:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:33,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-14 06:38:33,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:33,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:33,628 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:38:33,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 06:38:33,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:33,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:33,934 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:38:33,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:38:33,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:33,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:38:34,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:38:34,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:38:34,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:34,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:38:34,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:34,293 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:38:34,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2022-07-14 06:38:34,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-14 06:38:34,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-14 06:38:34,751 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:38:34,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:38:34,784 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-14 06:38:34,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 06:38:35,368 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:38:35,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 61 [2022-07-14 06:38:35,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:38:36,101 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-14 06:38:36,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 61 [2022-07-14 06:38:36,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:38:36,998 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:38:36,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2022-07-14 06:38:37,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:38:37,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-07-14 06:38:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:37,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:37,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:37,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143621351] [2022-07-14 06:38:37,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143621351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:37,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:37,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-07-14 06:38:37,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910199121] [2022-07-14 06:38:37,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:37,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:38:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:37,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:38:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:38:37,192 INFO L87 Difference]: Start difference. First operand 271 states and 306 transitions. Second operand has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:37,922 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-07-14 06:38:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 06:38:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-14 06:38:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:37,924 INFO L225 Difference]: With dead ends: 271 [2022-07-14 06:38:37,924 INFO L226 Difference]: Without dead ends: 271 [2022-07-14 06:38:37,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:38:37,925 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 13 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1087 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:37,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1804 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 179 Invalid, 0 Unknown, 1087 Unchecked, 0.3s Time] [2022-07-14 06:38:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-14 06:38:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-07-14 06:38:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 252 states have internal predecessors, (281), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2022-07-14 06:38:37,932 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 47 [2022-07-14 06:38:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:37,933 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2022-07-14 06:38:37,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2022-07-14 06:38:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:38:37,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:37,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:37,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-14 06:38:38,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:38,146 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:38,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:38,146 INFO L85 PathProgramCache]: Analyzing trace with hash 870106982, now seen corresponding path program 1 times [2022-07-14 06:38:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:38,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744407097] [2022-07-14 06:38:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:38,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:38,149 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:38,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 06:38:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:38,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:38:38,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:38,577 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:38:38,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2022-07-14 06:38:38,789 INFO L356 Elim1Store]: treesize reduction 29, result has 50.0 percent of original size [2022-07-14 06:38:38,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 45 [2022-07-14 06:38:38,939 INFO L356 Elim1Store]: treesize reduction 84, result has 36.8 percent of original size [2022-07-14 06:38:38,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 76 [2022-07-14 06:38:39,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-14 06:38:39,460 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-14 06:38:39,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2022-07-14 06:38:39,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:39,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:39,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:39,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:40,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2022-07-14 06:38:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:40,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:40,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:40,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744407097] [2022-07-14 06:38:40,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744407097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:40,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:40,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-14 06:38:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926850275] [2022-07-14 06:38:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:38:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:38:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:38:40,806 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 20 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:41,256 INFO L93 Difference]: Finished difference Result 284 states and 320 transitions. [2022-07-14 06:38:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:38:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-14 06:38:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:41,258 INFO L225 Difference]: With dead ends: 284 [2022-07-14 06:38:41,258 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 06:38:41,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:38:41,258 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 873 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:41,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1443 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 0 Unknown, 873 Unchecked, 0.3s Time] [2022-07-14 06:38:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 06:38:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2022-07-14 06:38:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 197 states have (on average 1.4619289340101522) internal successors, (288), 258 states have internal predecessors, (288), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 312 transitions. [2022-07-14 06:38:41,264 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 312 transitions. Word has length 47 [2022-07-14 06:38:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:41,264 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 312 transitions. [2022-07-14 06:38:41,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 312 transitions. [2022-07-14 06:38:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:38:41,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:41,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:41,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:41,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:41,479 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash 870106983, now seen corresponding path program 1 times [2022-07-14 06:38:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:41,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450087687] [2022-07-14 06:38:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:41,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:41,481 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:41,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 06:38:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:41,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-14 06:38:41,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:41,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:41,895 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:38:41,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-14 06:38:41,996 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:41,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:42,019 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:38:42,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-14 06:38:42,078 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:42,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:38:42,204 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:42,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 06:38:42,234 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-14 06:38:42,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:38:42,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-07-14 06:38:42,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-07-14 06:38:42,622 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-14 06:38:42,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2022-07-14 06:38:42,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:42,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-14 06:38:42,784 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:42,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:42,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:42,820 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:42,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:42,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:42,922 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:42,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:42,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:42,961 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:42,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:42,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:43,105 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:43,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:43,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:43,132 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:43,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:43,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:43,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:43,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:43,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:38:43,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:38:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:43,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:43,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:43,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450087687] [2022-07-14 06:38:43,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450087687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:43,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:43,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-14 06:38:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052020277] [2022-07-14 06:38:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:43,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:38:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:43,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:38:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:38:43,660 INFO L87 Difference]: Start difference. First operand 277 states and 312 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:45,133 INFO L93 Difference]: Finished difference Result 284 states and 319 transitions. [2022-07-14 06:38:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:38:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-07-14 06:38:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:45,135 INFO L225 Difference]: With dead ends: 284 [2022-07-14 06:38:45,135 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 06:38:45,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:38:45,136 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 86 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 527 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:45,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1477 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 902 Invalid, 0 Unknown, 527 Unchecked, 1.0s Time] [2022-07-14 06:38:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 06:38:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2022-07-14 06:38:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 258 states have internal predecessors, (287), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 311 transitions. [2022-07-14 06:38:45,142 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 311 transitions. Word has length 47 [2022-07-14 06:38:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:45,142 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 311 transitions. [2022-07-14 06:38:45,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 18 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 311 transitions. [2022-07-14 06:38:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:38:45,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:45,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-14 06:38:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:45,357 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -479935114, now seen corresponding path program 1 times [2022-07-14 06:38:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187722208] [2022-07-14 06:38:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:45,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:45,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:45,359 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:45,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-14 06:38:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:45,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:38:45,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:45,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:45,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:45,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187722208] [2022-07-14 06:38:45,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187722208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:45,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:45,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:38:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394897956] [2022-07-14 06:38:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:45,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:38:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:45,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:38:45,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:38:45,570 INFO L87 Difference]: Start difference. First operand 277 states and 311 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:45,587 INFO L93 Difference]: Finished difference Result 294 states and 326 transitions. [2022-07-14 06:38:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:38:45,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-07-14 06:38:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:45,589 INFO L225 Difference]: With dead ends: 294 [2022-07-14 06:38:45,589 INFO L226 Difference]: Without dead ends: 294 [2022-07-14 06:38:45,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:38:45,591 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 77 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:45,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 554 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:38:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-14 06:38:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 275. [2022-07-14 06:38:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 256 states have internal predecessors, (282), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 306 transitions. [2022-07-14 06:38:45,597 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 306 transitions. Word has length 49 [2022-07-14 06:38:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:45,597 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 306 transitions. [2022-07-14 06:38:45,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:38:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 306 transitions. [2022-07-14 06:38:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:38:45,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:45,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:45,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-14 06:38:45,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:45,810 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1345808633, now seen corresponding path program 1 times [2022-07-14 06:38:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:45,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569561567] [2022-07-14 06:38:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:45,812 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:45,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 06:38:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:46,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-14 06:38:46,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:46,509 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:38:46,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2022-07-14 06:38:46,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:46,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:46,750 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:38:46,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2022-07-14 06:38:46,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:46,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:46,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:46,829 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:38:46,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-14 06:38:46,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,047 INFO L356 Elim1Store]: treesize reduction 100, result has 36.3 percent of original size [2022-07-14 06:38:47,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 36 treesize of output 77 [2022-07-14 06:38:47,373 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 06:38:47,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2022-07-14 06:38:47,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:47,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-14 06:38:47,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:47,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:48,005 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:48,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2022-07-14 06:38:48,580 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:48,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:48,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:48,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:48,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:48,611 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:48,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:38:48,798 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:48,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:48,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:48,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:48,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:48,831 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:48,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:38:49,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:49,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:49,164 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:49,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:38:49,276 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:49,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 06:38:49,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:49,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:49,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:49,511 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:49,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-07-14 06:38:49,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:49,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:38:50,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:38:51,795 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-14 06:38:51,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2022-07-14 06:38:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:38:53,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:38:53,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:38:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569561567] [2022-07-14 06:38:53,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569561567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:38:53,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:38:53,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-14 06:38:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149077860] [2022-07-14 06:38:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:38:53,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:38:53,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:38:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:38:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:38:53,061 INFO L87 Difference]: Start difference. First operand 275 states and 306 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:38:54,272 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2022-07-14 06:38:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:38:54,273 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2022-07-14 06:38:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:38:54,274 INFO L225 Difference]: With dead ends: 284 [2022-07-14 06:38:54,274 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 06:38:54,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:38:54,275 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 71 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 924 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:38:54,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1577 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 663 Invalid, 0 Unknown, 924 Unchecked, 0.7s Time] [2022-07-14 06:38:54,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 06:38:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2022-07-14 06:38:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 197 states have (on average 1.4467005076142132) internal successors, (285), 258 states have internal predecessors, (285), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:38:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 309 transitions. [2022-07-14 06:38:54,280 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 309 transitions. Word has length 49 [2022-07-14 06:38:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:38:54,281 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 309 transitions. [2022-07-14 06:38:54,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:38:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 309 transitions. [2022-07-14 06:38:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:38:54,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:38:54,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:38:54,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-14 06:38:54,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:38:54,491 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:38:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:38:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1345808632, now seen corresponding path program 1 times [2022-07-14 06:38:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:38:54,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464712696] [2022-07-14 06:38:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:38:54,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:38:54,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:38:54,494 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:38:54,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 06:38:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:38:55,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-14 06:38:55,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:38:55,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:55,099 INFO L356 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2022-07-14 06:38:55,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 28 [2022-07-14 06:38:55,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:55,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:38:55,294 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:38:55,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:38:55,349 INFO L356 Elim1Store]: treesize reduction 81, result has 35.7 percent of original size [2022-07-14 06:38:55,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 66 [2022-07-14 06:38:55,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-14 06:38:55,459 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-14 06:38:55,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2022-07-14 06:38:55,723 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:38:55,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-14 06:38:55,762 INFO L356 Elim1Store]: treesize reduction 40, result has 34.4 percent of original size [2022-07-14 06:38:55,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 46 [2022-07-14 06:38:56,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-07-14 06:38:56,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:38:56,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,571 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:56,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 57 [2022-07-14 06:38:56,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-14 06:38:56,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:56,616 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:56,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2022-07-14 06:38:57,125 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 06:38:57,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2022-07-14 06:38:57,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:57,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,169 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:57,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-14 06:38:57,215 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:57,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2022-07-14 06:38:57,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-14 06:38:57,459 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:57,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2022-07-14 06:38:57,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-14 06:38:57,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,512 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:57,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-14 06:38:57,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,587 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-14 06:38:57,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-07-14 06:38:57,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:38:57,795 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:38:57,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2022-07-14 06:38:57,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-14 06:38:57,865 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-14 06:38:57,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2022-07-14 06:38:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:57,932 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:57,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-14 06:38:58,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:58,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:58,160 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:38:58,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-14 06:38:58,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:58,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-14 06:38:58,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:58,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:58,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:38:58,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-07-14 06:39:02,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-07-14 06:39:02,879 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-14 06:39:02,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 45 [2022-07-14 06:39:02,892 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:39:02,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-14 06:39:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:03,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:39:03,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:39:03,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464712696] [2022-07-14 06:39:03,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464712696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:03,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:03,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-14 06:39:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444593890] [2022-07-14 06:39:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:03,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:39:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:39:03,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:39:03,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:39:03,124 INFO L87 Difference]: Start difference. First operand 277 states and 309 transitions. Second operand has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:39:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:03,841 INFO L93 Difference]: Finished difference Result 351 states and 392 transitions. [2022-07-14 06:39:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:39:03,842 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2022-07-14 06:39:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:03,843 INFO L225 Difference]: With dead ends: 351 [2022-07-14 06:39:03,843 INFO L226 Difference]: Without dead ends: 351 [2022-07-14 06:39:03,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 06:39:03,843 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 69 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1041 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:03,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2327 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 0 Unknown, 1041 Unchecked, 0.4s Time] [2022-07-14 06:39:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-14 06:39:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 301. [2022-07-14 06:39:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 221 states have (on average 1.411764705882353) internal successors, (312), 282 states have internal predecessors, (312), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:39:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 336 transitions. [2022-07-14 06:39:03,849 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 336 transitions. Word has length 49 [2022-07-14 06:39:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:03,850 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 336 transitions. [2022-07-14 06:39:03,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:39:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 336 transitions. [2022-07-14 06:39:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:39:03,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:03,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:03,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-14 06:39:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:39:04,064 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2022-07-14 06:39:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 459629702, now seen corresponding path program 1 times [2022-07-14 06:39:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:39:04,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538706512] [2022-07-14 06:39:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:39:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:39:04,067 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:39:04,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-14 06:39:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:39:04,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 06:39:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:39:05,051 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 06:39:05,052 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 06:39:05,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 79 remaining) [2022-07-14 06:39:05,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2022-07-14 06:39:05,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2022-07-14 06:39:05,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2022-07-14 06:39:05,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2022-07-14 06:39:05,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr4ASSERT_VIOLATIONMEMORY_FREE (73 of 79 remaining) [2022-07-14 06:39:05,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr5ASSERT_VIOLATIONMEMORY_FREE (72 of 79 remaining) [2022-07-14 06:39:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr6ASSERT_VIOLATIONMEMORY_FREE (71 of 79 remaining) [2022-07-14 06:39:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2022-07-14 06:39:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location free_reportsErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2022-07-14 06:39:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2022-07-14 06:39:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2022-07-14 06:39:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2022-07-14 06:39:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2022-07-14 06:39:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2022-07-14 06:39:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2022-07-14 06:39:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2022-07-14 06:39:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2022-07-14 06:39:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2022-07-14 06:39:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2022-07-14 06:39:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2022-07-14 06:39:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2022-07-14 06:39:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2022-07-14 06:39:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2022-07-14 06:39:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2022-07-14 06:39:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2022-07-14 06:39:05,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 79 remaining) [2022-07-14 06:39:05,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX (32 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2022-07-14 06:39:05,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2022-07-14 06:39:05,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2022-07-14 06:39:05,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2022-07-14 06:39:05,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2022-07-14 06:39:05,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2022-07-14 06:39:05,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2022-07-14 06:39:05,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (18 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (17 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (16 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2022-07-14 06:39:05,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (13 of 79 remaining) [2022-07-14 06:39:05,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (12 of 79 remaining) [2022-07-14 06:39:05,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (11 of 79 remaining) [2022-07-14 06:39:05,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (10 of 79 remaining) [2022-07-14 06:39:05,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (9 of 79 remaining) [2022-07-14 06:39:05,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (8 of 79 remaining) [2022-07-14 06:39:05,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (3 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (2 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (1 of 79 remaining) [2022-07-14 06:39:05,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (0 of 79 remaining) [2022-07-14 06:39:05,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:39:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:39:05,299 INFO L356 BasicCegarLoop]: Path program 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:05,302 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:39:05,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:39:05 BoogieIcfgContainer [2022-07-14 06:39:05,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:39:05,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:39:05,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:39:05,366 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:39:05,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:38:00" (3/4) ... [2022-07-14 06:39:05,368 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 06:39:05,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-07-14 06:39:05,416 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 06:39:05,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:39:05,417 INFO L158 Benchmark]: Toolchain (without parser) took 66081.01ms. Allocated memory was 58.7MB in the beginning and 151.0MB in the end (delta: 92.3MB). Free memory was 43.3MB in the beginning and 94.4MB in the end (delta: -51.1MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,417 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.3MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:39:05,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.38ms. Allocated memory is still 58.7MB. Free memory was 43.1MB in the beginning and 33.0MB in the end (delta: 10.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.70ms. Allocated memory is still 58.7MB. Free memory was 33.0MB in the beginning and 30.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,418 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 58.7MB. Free memory was 30.0MB in the beginning and 27.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,418 INFO L158 Benchmark]: RCFGBuilder took 831.12ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 35.6MB in the end (delta: -8.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,418 INFO L158 Benchmark]: TraceAbstraction took 64404.40ms. Allocated memory was 71.3MB in the beginning and 151.0MB in the end (delta: 79.7MB). Free memory was 34.9MB in the beginning and 99.7MB in the end (delta: -64.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,418 INFO L158 Benchmark]: Witness Printer took 50.74ms. Allocated memory is still 151.0MB. Free memory was 99.7MB in the beginning and 94.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 06:39:05,419 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.3MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.38ms. Allocated memory is still 58.7MB. Free memory was 43.1MB in the beginning and 33.0MB in the end (delta: 10.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.70ms. Allocated memory is still 58.7MB. Free memory was 33.0MB in the beginning and 30.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 58.7MB. Free memory was 30.0MB in the beginning and 27.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 831.12ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 35.6MB in the end (delta: -8.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * TraceAbstraction took 64404.40ms. Allocated memory was 71.3MB in the beginning and 151.0MB in the end (delta: 79.7MB). Free memory was 34.9MB in the beginning and 99.7MB in the end (delta: -64.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 50.74ms. Allocated memory is still 151.0MB. Free memory was 99.7MB in the beginning and 94.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L820-L823] static int (*dispatch_type[])(struct hid_parser *parser, struct hid_item *item) = { hid_parser_main }; [L859] struct hid_device dev; VAL [dev={2:0}, ldv_global_msg_list={1:0}] [L867] CALL entry_point() [L861] CALL probe_23(&dev) [L842] int ret = - -3; VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, ret=3] [L843] CALL, EXPR ldv_malloc(sizeof(struct hid_report_enum)) VAL [\old(size)=1036, dev={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L843] RET, EXPR ldv_malloc(sizeof(struct hid_report_enum)) VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct hid_report_enum))={10:0}, ret=3] [L843] struct hid_report_enum *p = (struct hid_report_enum *)ldv_malloc(sizeof(struct hid_report_enum)); [L844] COND FALSE !(p==0) VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, p={10:0}, ret=3] [L846] CALL LDV_INIT_LIST_HEAD(&p->report_list) VAL [dev={2:0}, ldv_global_msg_list={1:0}, list={10:4}] [L540] list->next = list VAL [dev={2:0}, ldv_global_msg_list={1:0}, list={10:4}, list={10:4}] [L541] list->prev = list VAL [dev={2:0}, ldv_global_msg_list={1:0}, list={10:4}, list={10:4}] [L846] RET LDV_INIT_LIST_HEAD(&p->report_list) VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, p={10:0}, ret=3] [L847] dev->report_enum = p VAL [dev={2:0}, dev={2:0}, dev={2:0}, ldv_global_msg_list={1:0}, p={10:0}, ret=3] [L848] CALL hid_open_report(dev) [L812] struct hid_parser *parser; [L813] struct hid_item item; VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}] [L814] CALL, EXPR ldv_zalloc(sizeof(struct hid_parser)) VAL [dev={2:0}, ldv_global_msg_list={1:0}] [L533] EXPR, FCALL calloc(size, 1) [L533] return calloc(size, 1); VAL [\old(size)=8, \result={6:0}, calloc(size, 1)={6:0}, dev={2:0}, ldv_global_msg_list={1:0}, size=8] [L814] RET, EXPR ldv_zalloc(sizeof(struct hid_parser)) VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, ldv_zalloc(sizeof(struct hid_parser))={6:0}] [L814] parser = ldv_zalloc(sizeof(struct hid_parser)) [L815] COND FALSE !(!parser) VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}] [L818] parser->device = device VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}] [L819] CALL, EXPR ldv_positive() [L519] int r = __VERIFIER_nondet_int(); [L520] COND TRUE r>0 [L520] return r; VAL [\result=1610612738, dev={2:0}, ldv_global_msg_list={1:0}, r=1610612738] [L819] RET, EXPR ldv_positive() [L819] parser->report_id = ldv_positive() VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, ldv_global_msg_list={1:0}, ldv_positive()=1610612738, parser={6:0}] [L824] CALL, EXPR fetch_item(&item) [L778] COND FALSE !(__VERIFIER_nondet_int()) [L781] item->type = 0 VAL [dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L782] item->a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L783] item->b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L784] item->c = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L785] return 0; VAL [\result=0, dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}] [L824] RET, EXPR fetch_item(&item) [L824] COND TRUE fetch_item(&item)!=-1 [L825] EXPR item.type VAL [dev={2:0}, device={2:0}, device={2:0}, item={18:0}, item.type=0, ldv_global_msg_list={1:0}, parser={6:0}] [L825] EXPR dispatch_type[item.type] [L825] CALL dispatch_type[item.type](parser, &item) [L800] EXPR parser->device VAL [dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}, parser={6:0}, parser->device={2:0}] [L800] EXPR parser->report_id VAL [dev={2:0}, item={18:0}, item={18:0}, ldv_global_msg_list={1:0}, parser={6:0}, parser={6:0}, parser->device={2:0}, parser->report_id=1610612738] [L800] CALL hid_register_report(parser->device, parser->report_id) [L788] EXPR device->report_enum VAL [\old(id)=1610612738, dev={2:0}, device={2:0}, device={2:0}, device->report_enum={10:0}, id=1610612738, ldv_global_msg_list={1:0}] [L788] struct hid_report_enum *report_enum = device->report_enum; [L789] struct hid_report *report; VAL [\old(id)=1610612738, dev={2:0}, device={2:0}, device={2:0}, id=1610612738, ldv_global_msg_list={1:0}, report_enum={10:0}] [L790] report_enum->report_id_hash[id] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 204 locations, 79 error locations. Started 1 CEGAR loops. OverallTime: 64.3s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2759 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2712 mSDsluCounter, 30357 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7799 IncrementalHoareTripleChecker+Unchecked, 24812 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9284 IncrementalHoareTripleChecker+Invalid, 17342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 5545 mSDtfsCounter, 9284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1105 GetRequests, 708 SyntacticMatches, 25 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=31, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 739 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1012 ConstructedInterpolants, 338 QuantifiedInterpolants, 22168 SizeOfPredicates, 335 NumberOfNonLiveVariables, 6101 ConjunctsInSsa, 815 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-14 06:39:05,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)