./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.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/uthash-2.0.2/uthash_BER_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:52:48,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:52:48,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:52:48,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:52:48,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:52:48,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:52:48,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:52:48,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:52:48,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:52:48,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:52:48,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:52:48,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:52:48,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:52:48,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:52:48,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:52:48,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:52:48,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:52:48,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:52:48,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:52:48,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:52:48,084 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:52:48,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:52:48,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:52:48,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:52:48,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:52:48,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:52:48,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:52:48,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:52:48,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:52:48,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:52:48,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:52:48,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:52:48,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:52:48,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:52:48,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:52:48,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:52:48,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:52:48,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:52:48,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:52:48,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:52:48,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:52:48,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:52:48,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 12:52:48,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:52:48,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:52:48,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:52:48,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:52:48,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:52:48,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:52:48,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:52:48,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:52:48,131 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:52:48,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:52:48,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:52:48,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:52:48,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:52:48,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:52:48,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:52:48,132 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:52:48,133 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:52:48,133 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:52:48,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:52:48,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:52:48,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:52:48,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:52:48,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:52:48,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:52:48,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:52:48,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:52:48,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:52:48,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:52:48,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 12:52:48,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 12:52:48,136 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2022-07-14 12:52:48,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:52:48,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:52:48,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:52:48,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:52:48,375 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:52:48,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-07-14 12:52:48,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d537238/74d571bba7f9474195f7182c6e501afb/FLAGf008b3657 [2022-07-14 12:52:48,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:52:48,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-07-14 12:52:48,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d537238/74d571bba7f9474195f7182c6e501afb/FLAGf008b3657 [2022-07-14 12:52:48,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d537238/74d571bba7f9474195f7182c6e501afb [2022-07-14 12:52:48,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:52:48,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:52:48,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:52:48,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:52:48,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:52:48,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:52:48" (1/1) ... [2022-07-14 12:52:48,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2336ecea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:48, skipping insertion in model container [2022-07-14 12:52:48,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:52:48" (1/1) ... [2022-07-14 12:52:48,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:52:48,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:52:49,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-07-14 12:52:49,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:52:49,289 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 12:52:49,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25b1bb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:49, skipping insertion in model container [2022-07-14 12:52:49,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:52:49,290 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 12:52:49,292 INFO L158 Benchmark]: Toolchain (without parser) took 412.89ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 76.4MB in the beginning and 93.6MB in the end (delta: -17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 12:52:49,292 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 12:52:49,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.37ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 76.4MB in the beginning and 93.6MB in the end (delta: -17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 12:52:49,294 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.10ms. Allocated memory is still 107.0MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.37ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 76.4MB in the beginning and 93.6MB in the end (delta: -17.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:52:50,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:52:50,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:52:50,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:52:50,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:52:50,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:52:50,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:52:50,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:52:50,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:52:50,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:52:50,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:52:50,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:52:50,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:52:50,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:52:50,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:52:50,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:52:50,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:52:50,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:52:50,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:52:50,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:52:50,664 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:52:50,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:52:50,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:52:50,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:52:50,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:52:50,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:52:50,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:52:50,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:52:50,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:52:50,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:52:50,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:52:50,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:52:50,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:52:50,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:52:50,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:52:50,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:52:50,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:52:50,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:52:50,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:52:50,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:52:50,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:52:50,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:52:50,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 12:52:50,692 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:52:50,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:52:50,693 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:52:50,693 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:52:50,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:52:50,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:52:50,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:52:50,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:52:50,694 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:52:50,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:52:50,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:52:50,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:52:50,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:52:50,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:52:50,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 12:52:50,696 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 12:52:50,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:52:50,697 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:52:50,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:52:50,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:52:50,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:52:50,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:52:50,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:52:50,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:52:50,698 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 12:52:50,699 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 12:52:50,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 12:52:50,699 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2022-07-14 12:52:50,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:52:50,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:52:50,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:52:50,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:52:50,961 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:52:50,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-07-14 12:52:51,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101f840ac/fc2a3ef95c2a424eaca41aa43202990b/FLAGab55c31f4 [2022-07-14 12:52:51,421 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:52:51,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2022-07-14 12:52:51,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101f840ac/fc2a3ef95c2a424eaca41aa43202990b/FLAGab55c31f4 [2022-07-14 12:52:51,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101f840ac/fc2a3ef95c2a424eaca41aa43202990b [2022-07-14 12:52:51,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:52:51,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:52:51,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:52:51,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:52:51,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:52:51,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:52:51" (1/1) ... [2022-07-14 12:52:51,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0eaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:51, skipping insertion in model container [2022-07-14 12:52:51,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:52:51" (1/1) ... [2022-07-14 12:52:51,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:52:51,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:52:51,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-07-14 12:52:51,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:52:51,882 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 12:52:51,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:52:51,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-07-14 12:52:51,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:52:51,964 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 12:52:51,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i[33021,33034] [2022-07-14 12:52:52,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:52:52,058 INFO L208 MainTranslator]: Completed translation [2022-07-14 12:52:52,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52 WrapperNode [2022-07-14 12:52:52,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:52:52,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 12:52:52,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 12:52:52,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 12:52:52,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,159 INFO L137 Inliner]: procedures = 180, calls = 349, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1166 [2022-07-14 12:52:52,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 12:52:52,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 12:52:52,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 12:52:52,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 12:52:52,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 12:52:52,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 12:52:52,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 12:52:52,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 12:52:52,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (1/1) ... [2022-07-14 12:52:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:52:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 12:52:52,288 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 12:52:52,324 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 12:52:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 12:52:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 12:52:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 12:52:52,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 12:52:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 12:52:52,332 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 12:52:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 12:52:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 12:52:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 12:52:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 12:52:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 12:52:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 12:52:52,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 12:52:52,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 12:52:52,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 12:52:52,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 12:52:52,564 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 12:52:52,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 12:52:52,568 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 12:52:55,880 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 12:52:55,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 12:52:55,903 INFO L299 CfgBuilder]: Removed 60 assume(true) statements. [2022-07-14 12:52:55,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:52:55 BoogieIcfgContainer [2022-07-14 12:52:55,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 12:52:55,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 12:52:55,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 12:52:55,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 12:52:55,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:52:51" (1/3) ... [2022-07-14 12:52:55,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216c4534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:52:55, skipping insertion in model container [2022-07-14 12:52:55,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:52:52" (2/3) ... [2022-07-14 12:52:55,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216c4534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:52:55, skipping insertion in model container [2022-07-14 12:52:55,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:52:55" (3/3) ... [2022-07-14 12:52:55,915 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2022-07-14 12:52:55,925 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 12:52:55,925 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2022-07-14 12:52:55,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 12:52:55,989 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@2d310a89, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@176db06e [2022-07-14 12:52:55,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2022-07-14 12:52:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 1274 states, 613 states have (on average 2.257748776508972) internal successors, (1384), 1265 states have internal predecessors, (1384), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:52:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:52:56,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:56,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:52:56,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:52:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-14 12:52:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:56,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156837875] [2022-07-14 12:52:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:56,017 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 12:52:56,054 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 12:52:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:56,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 12:52:56,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:56,174 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 12:52:56,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:56,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156837875] [2022-07-14 12:52:56,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156837875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:56,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:56,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:52:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575984676] [2022-07-14 12:52:56,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:56,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 12:52:56,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 12:52:56,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 12:52:56,204 INFO L87 Difference]: Start difference. First operand has 1274 states, 613 states have (on average 2.257748776508972) internal successors, (1384), 1265 states have internal predecessors, (1384), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:56,269 INFO L93 Difference]: Finished difference Result 1256 states and 1330 transitions. [2022-07-14 12:52:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 12:52:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:52:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:56,296 INFO L225 Difference]: With dead ends: 1256 [2022-07-14 12:52:56,296 INFO L226 Difference]: Without dead ends: 1254 [2022-07-14 12:52:56,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 12:52:56,299 INFO L413 NwaCegarLoop]: 1330 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:56,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:52:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-07-14 12:52:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2022-07-14 12:52:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 604 states have (on average 2.1456953642384105) internal successors, (1296), 1245 states have internal predecessors, (1296), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:52:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1328 transitions. [2022-07-14 12:52:56,386 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1328 transitions. Word has length 5 [2022-07-14 12:52:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:56,386 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1328 transitions. [2022-07-14 12:52:56,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1328 transitions. [2022-07-14 12:52:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:52:56,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:56,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:52:56,396 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 12:52:56,595 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 12:52:56,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:52:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-14 12:52:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:56,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330425651] [2022-07-14 12:52:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:56,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:56,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:56,599 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 12:52:56,600 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 12:52:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:56,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:52:56,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:56,757 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 12:52:56,767 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 12:52:56,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:56,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:56,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330425651] [2022-07-14 12:52:56,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330425651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:56,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:56,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:52:56,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358645323] [2022-07-14 12:52:56,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:56,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:52:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:56,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:52:56,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:56,772 INFO L87 Difference]: Start difference. First operand 1254 states and 1328 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:52:58,234 INFO L93 Difference]: Finished difference Result 1291 states and 1378 transitions. [2022-07-14 12:52:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:52:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:52:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:52:58,239 INFO L225 Difference]: With dead ends: 1291 [2022-07-14 12:52:58,239 INFO L226 Difference]: Without dead ends: 1291 [2022-07-14 12:52:58,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:58,240 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1159 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 12:52:58,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 704 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-14 12:52:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-07-14 12:52:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1237. [2022-07-14 12:52:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 680 states have (on average 1.9676470588235293) internal successors, (1338), 1228 states have internal predecessors, (1338), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:52:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1370 transitions. [2022-07-14 12:52:58,266 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1370 transitions. Word has length 5 [2022-07-14 12:52:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:52:58,266 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1370 transitions. [2022-07-14 12:52:58,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:52:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1370 transitions. [2022-07-14 12:52:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:52:58,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:52:58,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:52:58,275 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 12:52:58,473 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 12:52:58,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:52:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:52:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-14 12:52:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:52:58,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96373132] [2022-07-14 12:52:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:52:58,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:52:58,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:52:58,481 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 12:52:58,482 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 12:52:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:52:58,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:52:58,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:52:58,580 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 12:52:58,594 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 12:52:58,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:52:58,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:52:58,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96373132] [2022-07-14 12:52:58,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96373132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:52:58,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:52:58,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:52:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808435256] [2022-07-14 12:52:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:52:58,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:52:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:52:58,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:52:58,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:52:58,597 INFO L87 Difference]: Start difference. First operand 1237 states and 1370 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:00,592 INFO L93 Difference]: Finished difference Result 1540 states and 1693 transitions. [2022-07-14 12:53:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:53:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:00,597 INFO L225 Difference]: With dead ends: 1540 [2022-07-14 12:53:00,597 INFO L226 Difference]: Without dead ends: 1540 [2022-07-14 12:53:00,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:00,600 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 504 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:00,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1483 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-14 12:53:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-07-14 12:53:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1393. [2022-07-14 12:53:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 846 states have (on average 1.9432624113475176) internal successors, (1644), 1384 states have internal predecessors, (1644), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1676 transitions. [2022-07-14 12:53:00,628 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1676 transitions. Word has length 5 [2022-07-14 12:53:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:00,628 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1676 transitions. [2022-07-14 12:53:00,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1676 transitions. [2022-07-14 12:53:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 12:53:00,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:00,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 12:53:00,637 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 12:53:00,837 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 12:53:00,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-14 12:53:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:00,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452928505] [2022-07-14 12:53:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:00,841 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 12:53:00,845 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 12:53:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:00,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:53:00,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:00,946 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 12:53:00,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:00,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:00,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452928505] [2022-07-14 12:53:00,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452928505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:00,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:00,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991029563] [2022-07-14 12:53:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:00,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:00,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:00,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:00,952 INFO L87 Difference]: Start difference. First operand 1393 states and 1676 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:01,022 INFO L93 Difference]: Finished difference Result 2737 states and 3283 transitions. [2022-07-14 12:53:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 12:53:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:01,035 INFO L225 Difference]: With dead ends: 2737 [2022-07-14 12:53:01,035 INFO L226 Difference]: Without dead ends: 2737 [2022-07-14 12:53:01,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:01,037 INFO L413 NwaCegarLoop]: 1675 mSDtfsCounter, 1143 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2894 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:01,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 2894 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2022-07-14 12:53:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1394. [2022-07-14 12:53:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 847 states have (on average 1.9421487603305785) internal successors, (1645), 1385 states have internal predecessors, (1645), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1677 transitions. [2022-07-14 12:53:01,065 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1677 transitions. Word has length 6 [2022-07-14 12:53:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:01,067 INFO L495 AbstractCegarLoop]: Abstraction has 1394 states and 1677 transitions. [2022-07-14 12:53:01,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1677 transitions. [2022-07-14 12:53:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 12:53:01,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:01,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:01,074 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 12:53:01,274 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 12:53:01,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-14 12:53:01,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:01,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337285872] [2022-07-14 12:53:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:01,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:01,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:01,277 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 12:53:01,278 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 12:53:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:01,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:53:01,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:01,394 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 12:53:01,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:01,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:01,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337285872] [2022-07-14 12:53:01,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337285872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:01,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:01,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:01,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386872542] [2022-07-14 12:53:01,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:01,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:01,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:01,397 INFO L87 Difference]: Start difference. First operand 1394 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:01,419 INFO L93 Difference]: Finished difference Result 1358 states and 1640 transitions. [2022-07-14 12:53:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:01,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 12:53:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:01,424 INFO L225 Difference]: With dead ends: 1358 [2022-07-14 12:53:01,424 INFO L226 Difference]: Without dead ends: 1358 [2022-07-14 12:53:01,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:01,424 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 1137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:01,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1210 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-07-14 12:53:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1352. [2022-07-14 12:53:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 829 states have (on average 1.9324487334137515) internal successors, (1602), 1343 states have internal predecessors, (1602), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1634 transitions. [2022-07-14 12:53:01,449 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1634 transitions. Word has length 11 [2022-07-14 12:53:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:01,450 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1634 transitions. [2022-07-14 12:53:01,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1634 transitions. [2022-07-14 12:53:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 12:53:01,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:01,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:01,459 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 12:53:01,657 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 12:53:01,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-14 12:53:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:01,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771439414] [2022-07-14 12:53:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:01,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:01,660 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 12:53:01,662 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 12:53:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:01,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:01,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:01,784 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 12:53:01,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:01,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:01,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771439414] [2022-07-14 12:53:01,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771439414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:01,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:01,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276643391] [2022-07-14 12:53:01,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:01,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:01,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:01,787 INFO L87 Difference]: Start difference. First operand 1352 states and 1634 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:01,838 INFO L93 Difference]: Finished difference Result 1337 states and 1612 transitions. [2022-07-14 12:53:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 12:53:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:01,842 INFO L225 Difference]: With dead ends: 1337 [2022-07-14 12:53:01,842 INFO L226 Difference]: Without dead ends: 1337 [2022-07-14 12:53:01,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 12:53:01,843 INFO L413 NwaCegarLoop]: 1132 mSDtfsCounter, 1108 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:01,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 2290 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2022-07-14 12:53:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1330. [2022-07-14 12:53:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 821 states have (on average 1.9159561510353227) internal successors, (1573), 1321 states have internal predecessors, (1573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1605 transitions. [2022-07-14 12:53:01,860 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1605 transitions. Word has length 13 [2022-07-14 12:53:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:01,860 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1605 transitions. [2022-07-14 12:53:01,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1605 transitions. [2022-07-14 12:53:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:53:01,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:01,861 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 12:53:01,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:02,068 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 12:53:02,069 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-14 12:53:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:02,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471899329] [2022-07-14 12:53:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:02,071 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 12:53:02,072 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 12:53:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:02,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:53:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:02,178 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 12:53:02,212 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 12:53:02,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:02,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:02,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471899329] [2022-07-14 12:53:02,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471899329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:02,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:02,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475997650] [2022-07-14 12:53:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:02,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:02,214 INFO L87 Difference]: Start difference. First operand 1330 states and 1605 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:04,085 INFO L93 Difference]: Finished difference Result 1791 states and 2054 transitions. [2022-07-14 12:53:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:53:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:53:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:04,090 INFO L225 Difference]: With dead ends: 1791 [2022-07-14 12:53:04,090 INFO L226 Difference]: Without dead ends: 1791 [2022-07-14 12:53:04,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 12:53:04,091 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 2394 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:04,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 1007 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 12:53:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2022-07-14 12:53:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1326. [2022-07-14 12:53:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 821 states have (on average 1.9110840438489647) internal successors, (1569), 1317 states have internal predecessors, (1569), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1601 transitions. [2022-07-14 12:53:04,108 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1601 transitions. Word has length 27 [2022-07-14 12:53:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:04,109 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1601 transitions. [2022-07-14 12:53:04,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1601 transitions. [2022-07-14 12:53:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:53:04,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:04,109 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 12:53:04,117 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 12:53:04,316 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 12:53:04,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-14 12:53:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993763426] [2022-07-14 12:53:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:04,319 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 12:53:04,319 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 12:53:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:04,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:53:04,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:04,441 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 12:53:04,559 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 12:53:04,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:04,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:04,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993763426] [2022-07-14 12:53:04,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993763426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:04,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:04,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:04,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448222533] [2022-07-14 12:53:04,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:04,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:04,561 INFO L87 Difference]: Start difference. First operand 1326 states and 1601 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:06,974 INFO L93 Difference]: Finished difference Result 1510 states and 1675 transitions. [2022-07-14 12:53:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:53:06,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:53:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:06,979 INFO L225 Difference]: With dead ends: 1510 [2022-07-14 12:53:06,979 INFO L226 Difference]: Without dead ends: 1510 [2022-07-14 12:53:06,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 12:53:06,980 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 851 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:06,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1923 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 12:53:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-07-14 12:53:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1322. [2022-07-14 12:53:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 821 states have (on average 1.9062119366626067) internal successors, (1565), 1313 states have internal predecessors, (1565), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1597 transitions. [2022-07-14 12:53:07,001 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1597 transitions. Word has length 27 [2022-07-14 12:53:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:07,001 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1597 transitions. [2022-07-14 12:53:07,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1597 transitions. [2022-07-14 12:53:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 12:53:07,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:07,002 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 12:53:07,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-14 12:53:07,212 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 12:53:07,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-14 12:53:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:07,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168319086] [2022-07-14 12:53:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:07,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:07,215 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 12:53:07,215 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 12:53:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:07,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:07,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:07,400 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 12:53:07,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:07,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:07,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168319086] [2022-07-14 12:53:07,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168319086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:07,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:07,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676156191] [2022-07-14 12:53:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:07,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:07,403 INFO L87 Difference]: Start difference. First operand 1322 states and 1597 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:07,441 INFO L93 Difference]: Finished difference Result 1322 states and 1593 transitions. [2022-07-14 12:53:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 12:53:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:07,445 INFO L225 Difference]: With dead ends: 1322 [2022-07-14 12:53:07,445 INFO L226 Difference]: Without dead ends: 1322 [2022-07-14 12:53:07,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 12:53:07,445 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 1084 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:07,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 2268 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2022-07-14 12:53:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1316. [2022-07-14 12:53:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 815 states have (on average 1.9079754601226995) internal successors, (1555), 1307 states have internal predecessors, (1555), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1587 transitions. [2022-07-14 12:53:07,460 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1587 transitions. Word has length 42 [2022-07-14 12:53:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:07,460 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1587 transitions. [2022-07-14 12:53:07,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1587 transitions. [2022-07-14 12:53:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 12:53:07,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:07,462 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, 1] [2022-07-14 12:53:07,472 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 12:53:07,672 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 12:53:07,672 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-14 12:53:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:07,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223103574] [2022-07-14 12:53:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:07,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:07,675 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 12:53:07,676 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 12:53:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:07,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:07,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:07,974 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 12:53:07,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:07,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:07,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223103574] [2022-07-14 12:53:07,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223103574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:07,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:07,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167700810] [2022-07-14 12:53:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:07,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:53:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:53:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:07,976 INFO L87 Difference]: Start difference. First operand 1316 states and 1587 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:08,027 INFO L93 Difference]: Finished difference Result 1362 states and 1633 transitions. [2022-07-14 12:53:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:53:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-14 12:53:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:08,031 INFO L225 Difference]: With dead ends: 1362 [2022-07-14 12:53:08,031 INFO L226 Difference]: Without dead ends: 1362 [2022-07-14 12:53:08,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:53:08,032 INFO L413 NwaCegarLoop]: 1134 mSDtfsCounter, 67 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:08,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2173 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-07-14 12:53:08,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1362. [2022-07-14 12:53:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 861 states have (on average 1.859465737514518) internal successors, (1601), 1353 states have internal predecessors, (1601), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1633 transitions. [2022-07-14 12:53:08,047 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1633 transitions. Word has length 50 [2022-07-14 12:53:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:08,047 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 1633 transitions. [2022-07-14 12:53:08,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1633 transitions. [2022-07-14 12:53:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 12:53:08,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:08,051 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, 1, 1, 1, 1] [2022-07-14 12:53:08,069 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 12:53:08,259 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 12:53:08,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:08,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-14 12:53:08,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:08,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046069767] [2022-07-14 12:53:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:08,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:08,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:08,263 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 12:53:08,264 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 12:53:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:08,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 12:53:08,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:08,508 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 12:53:08,512 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 12:53:08,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:53:08,754 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 12:53:08,761 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:53:08,761 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 12:53:08,771 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 12:53:08,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:08,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:08,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046069767] [2022-07-14 12:53:08,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046069767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:08,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:08,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:53:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926370520] [2022-07-14 12:53:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:08,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:08,772 INFO L87 Difference]: Start difference. First operand 1362 states and 1633 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:10,432 INFO L93 Difference]: Finished difference Result 1331 states and 1556 transitions. [2022-07-14 12:53:10,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:10,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-14 12:53:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:10,435 INFO L225 Difference]: With dead ends: 1331 [2022-07-14 12:53:10,435 INFO L226 Difference]: Without dead ends: 1331 [2022-07-14 12:53:10,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:10,436 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 2001 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:10,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 477 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 12:53:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-14 12:53:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1112. [2022-07-14 12:53:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 695 states have (on average 1.7266187050359711) internal successors, (1200), 1103 states have internal predecessors, (1200), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1232 transitions. [2022-07-14 12:53:10,447 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1232 transitions. Word has length 53 [2022-07-14 12:53:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:10,447 INFO L495 AbstractCegarLoop]: Abstraction has 1112 states and 1232 transitions. [2022-07-14 12:53:10,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1232 transitions. [2022-07-14 12:53:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:53:10,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:10,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:10,458 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 12:53:10,657 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 12:53:10,657 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-14 12:53:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:10,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436936436] [2022-07-14 12:53:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:10,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:10,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:10,659 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 12:53:10,661 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 12:53:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:10,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:53:10,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:10,846 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 12:53:10,853 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 13 treesize of output 9 [2022-07-14 12:53:10,867 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 21 treesize of output 9 [2022-07-14 12:53:10,873 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 12:53:10,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:10,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:10,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436936436] [2022-07-14 12:53:10,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436936436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:10,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579993448] [2022-07-14 12:53:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:53:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:53:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:10,875 INFO L87 Difference]: Start difference. First operand 1112 states and 1232 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:12,646 INFO L93 Difference]: Finished difference Result 1111 states and 1231 transitions. [2022-07-14 12:53:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:53:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 12:53:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:12,650 INFO L225 Difference]: With dead ends: 1111 [2022-07-14 12:53:12,650 INFO L226 Difference]: Without dead ends: 1111 [2022-07-14 12:53:12,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:53:12,651 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 4 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:12,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2649 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 12:53:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-07-14 12:53:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-07-14 12:53:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 695 states have (on average 1.725179856115108) internal successors, (1199), 1102 states have internal predecessors, (1199), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1231 transitions. [2022-07-14 12:53:12,662 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1231 transitions. Word has length 58 [2022-07-14 12:53:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:12,662 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 1231 transitions. [2022-07-14 12:53:12,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1231 transitions. [2022-07-14 12:53:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:53:12,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:12,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:12,691 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 12:53:12,875 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 12:53:12,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-14 12:53:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:12,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610378562] [2022-07-14 12:53:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:12,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:12,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:12,878 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 12:53:12,880 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 12:53:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:13,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 12:53:13,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:13,098 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 12:53:13,112 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 13 treesize of output 9 [2022-07-14 12:53:13,118 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 13 treesize of output 9 [2022-07-14 12:53:13,160 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 21 treesize of output 9 [2022-07-14 12:53:13,164 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 19 treesize of output 7 [2022-07-14 12:53:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:13,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:13,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:13,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610378562] [2022-07-14 12:53:13,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610378562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:13,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:13,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:13,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979742067] [2022-07-14 12:53:13,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:13,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:53:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:13,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:53:13,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:53:13,178 INFO L87 Difference]: Start difference. First operand 1111 states and 1231 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:15,363 INFO L93 Difference]: Finished difference Result 1110 states and 1230 transitions. [2022-07-14 12:53:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:53:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 12:53:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:15,366 INFO L225 Difference]: With dead ends: 1110 [2022-07-14 12:53:15,366 INFO L226 Difference]: Without dead ends: 1110 [2022-07-14 12:53:15,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:53:15,367 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 2 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:15,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2672 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 12:53:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-07-14 12:53:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-07-14 12:53:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 694 states have (on average 1.7262247838616716) internal successors, (1198), 1101 states have internal predecessors, (1198), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 12:53:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1230 transitions. [2022-07-14 12:53:15,390 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1230 transitions. Word has length 58 [2022-07-14 12:53:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:15,390 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1230 transitions. [2022-07-14 12:53:15,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:53:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1230 transitions. [2022-07-14 12:53:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 12:53:15,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:15,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:15,401 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 12:53:15,600 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 12:53:15,601 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2041767774, now seen corresponding path program 1 times [2022-07-14 12:53:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:15,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999492763] [2022-07-14 12:53:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:15,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:15,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:15,603 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 12:53:15,604 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 12:53:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:15,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:53:15,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:15,827 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 12:53:15,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:53:15,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:15,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999492763] [2022-07-14 12:53:15,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999492763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:53:15,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:53:15,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:53:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80434398] [2022-07-14 12:53:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:53:15,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:53:15,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:53:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:53:15,829 INFO L87 Difference]: Start difference. First operand 1110 states and 1230 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 12:53:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:15,863 INFO L93 Difference]: Finished difference Result 1113 states and 1235 transitions. [2022-07-14 12:53:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:53:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2022-07-14 12:53:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:15,869 INFO L225 Difference]: With dead ends: 1113 [2022-07-14 12:53:15,869 INFO L226 Difference]: Without dead ends: 1113 [2022-07-14 12:53:15,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 12:53:15,870 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 2 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:15,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3127 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:53:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2022-07-14 12:53:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2022-07-14 12:53:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 696 states have (on average 1.7255747126436782) internal successors, (1201), 1104 states have internal predecessors, (1201), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1235 transitions. [2022-07-14 12:53:15,885 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1235 transitions. Word has length 66 [2022-07-14 12:53:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:15,885 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1235 transitions. [2022-07-14 12:53:15,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 12:53:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1235 transitions. [2022-07-14 12:53:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:53:15,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:15,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:15,898 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 12:53:16,099 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 12:53:16,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -326306715, now seen corresponding path program 1 times [2022-07-14 12:53:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:16,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611012365] [2022-07-14 12:53:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:16,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:16,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:16,102 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 12:53:16,104 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 12:53:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:16,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:53:16,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:16,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:16,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:16,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611012365] [2022-07-14 12:53:16,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611012365] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:16,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:16,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 12:53:16,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423627002] [2022-07-14 12:53:16,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:16,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 12:53:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 12:53:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 12:53:16,385 INFO L87 Difference]: Start difference. First operand 1113 states and 1235 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:16,536 INFO L93 Difference]: Finished difference Result 1125 states and 1253 transitions. [2022-07-14 12:53:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 12:53:16,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-14 12:53:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:16,539 INFO L225 Difference]: With dead ends: 1125 [2022-07-14 12:53:16,539 INFO L226 Difference]: Without dead ends: 1125 [2022-07-14 12:53:16,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-14 12:53:16,540 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 23 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:16,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3129 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:53:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-07-14 12:53:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2022-07-14 12:53:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 705 states have (on average 1.724822695035461) internal successors, (1216), 1113 states have internal predecessors, (1216), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1250 transitions. [2022-07-14 12:53:16,551 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1250 transitions. Word has length 67 [2022-07-14 12:53:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:16,552 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1250 transitions. [2022-07-14 12:53:16,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1250 transitions. [2022-07-14 12:53:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 12:53:16,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:16,553 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:16,565 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 12:53:16,763 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 12:53:16,764 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1716613406, now seen corresponding path program 2 times [2022-07-14 12:53:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:16,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566427264] [2022-07-14 12:53:16,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 12:53:16,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:16,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:16,766 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 12:53:16,767 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 12:53:17,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 12:53:17,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:17,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:53:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:17,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:17,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:17,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566427264] [2022-07-14 12:53:17,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566427264] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:17,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:17,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-14 12:53:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995891468] [2022-07-14 12:53:17,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:17,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 12:53:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 12:53:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 12:53:17,222 INFO L87 Difference]: Start difference. First operand 1123 states and 1250 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:17,692 INFO L93 Difference]: Finished difference Result 1144 states and 1282 transitions. [2022-07-14 12:53:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 12:53:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-14 12:53:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:17,695 INFO L225 Difference]: With dead ends: 1144 [2022-07-14 12:53:17,695 INFO L226 Difference]: Without dead ends: 1140 [2022-07-14 12:53:17,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-14 12:53:17,696 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 73 mSDsluCounter, 6256 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 7304 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:17,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 7304 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:53:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-14 12:53:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1132. [2022-07-14 12:53:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 714 states have (on average 1.719887955182073) internal successors, (1228), 1122 states have internal predecessors, (1228), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1262 transitions. [2022-07-14 12:53:17,707 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1262 transitions. Word has length 70 [2022-07-14 12:53:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:17,707 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1262 transitions. [2022-07-14 12:53:17,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1262 transitions. [2022-07-14 12:53:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 12:53:17,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:17,708 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:17,720 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 12:53:17,918 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 12:53:17,918 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1956109246, now seen corresponding path program 3 times [2022-07-14 12:53:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:17,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881833174] [2022-07-14 12:53:17,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 12:53:17,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:17,921 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 12:53:17,923 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 12:53:18,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 12:53:18,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:18,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 12:53:18,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:18,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:18,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:18,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881833174] [2022-07-14 12:53:18,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881833174] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:18,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:18,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-14 12:53:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379152197] [2022-07-14 12:53:18,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:18,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 12:53:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 12:53:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 12:53:18,993 INFO L87 Difference]: Start difference. First operand 1132 states and 1262 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:21,491 INFO L93 Difference]: Finished difference Result 1174 states and 1338 transitions. [2022-07-14 12:53:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 12:53:21,491 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-14 12:53:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:21,494 INFO L225 Difference]: With dead ends: 1174 [2022-07-14 12:53:21,494 INFO L226 Difference]: Without dead ends: 1168 [2022-07-14 12:53:21,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 12:53:21,496 INFO L413 NwaCegarLoop]: 1052 mSDtfsCounter, 147 mSDsluCounter, 11516 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 12568 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:21,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 12568 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 12:53:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-07-14 12:53:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1150. [2022-07-14 12:53:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 732 states have (on average 1.709016393442623) internal successors, (1251), 1140 states have internal predecessors, (1251), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1285 transitions. [2022-07-14 12:53:21,507 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1285 transitions. Word has length 76 [2022-07-14 12:53:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:21,508 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1285 transitions. [2022-07-14 12:53:21,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1285 transitions. [2022-07-14 12:53:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 12:53:21,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:21,509 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:21,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:21,719 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 12:53:21,719 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1029224194, now seen corresponding path program 4 times [2022-07-14 12:53:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448520364] [2022-07-14 12:53:21,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 12:53:21,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:21,721 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 12:53:21,722 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 12:53:21,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 12:53:21,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:21,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 12:53:21,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:22,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:53:23,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:23,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448520364] [2022-07-14 12:53:23,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448520364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:53:23,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:23,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-14 12:53:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408534278] [2022-07-14 12:53:23,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:23,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 12:53:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 12:53:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 12:53:23,480 INFO L87 Difference]: Start difference. First operand 1150 states and 1285 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:32,563 INFO L93 Difference]: Finished difference Result 1230 states and 1418 transitions. [2022-07-14 12:53:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-14 12:53:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-14 12:53:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:32,566 INFO L225 Difference]: With dead ends: 1230 [2022-07-14 12:53:32,566 INFO L226 Difference]: Without dead ends: 1226 [2022-07-14 12:53:32,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-14 12:53:32,569 INFO L413 NwaCegarLoop]: 1065 mSDtfsCounter, 442 mSDsluCounter, 26459 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 27524 SdHoareTripleChecker+Invalid, 3575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:32,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 27524 Invalid, 3575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 3101 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 12:53:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-07-14 12:53:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1184. [2022-07-14 12:53:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 766 states have (on average 1.6932114882506528) internal successors, (1297), 1174 states have internal predecessors, (1297), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 12:53:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1331 transitions. [2022-07-14 12:53:32,585 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1331 transitions. Word has length 88 [2022-07-14 12:53:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:32,585 INFO L495 AbstractCegarLoop]: Abstraction has 1184 states and 1331 transitions. [2022-07-14 12:53:32,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:53:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1331 transitions. [2022-07-14 12:53:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 12:53:32,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:32,586 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:32,608 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 12:53:32,791 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 12:53:32,791 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:53:32,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1185723038, now seen corresponding path program 5 times [2022-07-14 12:53:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:32,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721469468] [2022-07-14 12:53:32,793 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:53:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:32,794 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 12:53:32,801 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 12:53:33,923 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:53:33,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:33,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 12:53:33,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:33,984 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 12:53:33,985 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 12:53:34,201 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 12:53:34,201 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 43 [2022-07-14 12:53:34,260 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 13 treesize of output 9 [2022-07-14 12:53:34,430 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 40 treesize of output 22 [2022-07-14 12:53:34,852 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1562) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:35,797 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1570)))) is different from true [2022-07-14 12:53:36,134 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1573)))) is different from true [2022-07-14 12:53:37,855 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1588)))) is different from true [2022-07-14 12:53:38,294 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1592) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:38,494 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1594 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1594)))) is different from true [2022-07-14 12:53:38,583 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1595) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:38,670 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1596) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:39,447 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1603 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1603)))) is different from true [2022-07-14 12:53:39,683 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1605)))) is different from true [2022-07-14 12:53:39,881 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:53:39,881 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-07-14 12:53:40,073 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 49 treesize of output 25 [2022-07-14 12:53:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 561 trivial. 395 not checked. [2022-07-14 12:53:40,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:40,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-14 12:53:40,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:40,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721469468] [2022-07-14 12:53:40,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721469468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:53:40,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1962096094] [2022-07-14 12:53:40,380 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:53:40,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:53:40,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:53:40,382 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:53:40,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-14 12:55:01,512 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:55:01,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:55:01,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 12:55:01,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:55:01,767 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 12:55:01,767 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 12:55:01,937 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 12:55:01,937 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 24 treesize of output 41 [2022-07-14 12:55:01,973 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 13 treesize of output 9 [2022-07-14 12:55:02,113 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 32 treesize of output 14 [2022-07-14 12:55:04,103 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:55:04,103 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-14 12:55:04,153 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 41 treesize of output 17 [2022-07-14 12:55:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-14 12:55:04,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:55:04,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1962096094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:55:04,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:55:04,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 26 [2022-07-14 12:55:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957364706] [2022-07-14 12:55:04,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:55:04,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 12:55:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:55:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 12:55:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=342, Unknown=38, NotChecked=528, Total=992 [2022-07-14 12:55:04,414 INFO L87 Difference]: Start difference. First operand 1184 states and 1331 transitions. Second operand has 28 states, 25 states have (on average 5.92) internal successors, (148), 27 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 12:55:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:55:09,458 INFO L93 Difference]: Finished difference Result 2115 states and 2325 transitions. [2022-07-14 12:55:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 12:55:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 5.92) internal successors, (148), 27 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-07-14 12:55:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:55:09,479 INFO L225 Difference]: With dead ends: 2115 [2022-07-14 12:55:09,479 INFO L226 Difference]: Without dead ends: 2111 [2022-07-14 12:55:09,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 117 SyntacticMatches, 84 SemanticMatches, 39 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=171, Invalid=687, Unknown=56, NotChecked=726, Total=1640 [2022-07-14 12:55:09,480 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 1003 mSDsluCounter, 6491 mSDsCounter, 0 mSdLazyCounter, 4390 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 7103 SdHoareTripleChecker+Invalid, 29696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25272 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-14 12:55:09,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 7103 Invalid, 29696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4390 Invalid, 0 Unknown, 25272 Unchecked, 4.5s Time] [2022-07-14 12:55:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-07-14 12:55:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1546. [2022-07-14 12:55:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1126 states have (on average 1.6580817051509769) internal successors, (1867), 1531 states have internal predecessors, (1867), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (22), 11 states have call predecessors, (22), 20 states have call successors, (22) [2022-07-14 12:55:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1909 transitions. [2022-07-14 12:55:09,497 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1909 transitions. Word has length 110 [2022-07-14 12:55:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:55:09,498 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 1909 transitions. [2022-07-14 12:55:09,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 5.92) internal successors, (148), 27 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 12:55:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1909 transitions. [2022-07-14 12:55:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 12:55:09,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:55:09,499 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:09,515 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 12:55:09,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2022-07-14 12:55:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 12:55:09,914 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2022-07-14 12:55:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:55:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1185723039, now seen corresponding path program 1 times [2022-07-14 12:55:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:55:09,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319880397] [2022-07-14 12:55:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:55:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:55:09,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:55:09,916 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 12:55:09,917 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 12:55:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:55:10,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-14 12:55:10,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:55:10,549 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 12:55:10,666 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:55:10,666 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 12:55:10,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-14 12:55:10,684 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 13 treesize of output 9 [2022-07-14 12:55:10,700 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 13 treesize of output 9 [2022-07-14 12:55:10,762 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 18 treesize of output 10 [2022-07-14 12:55:10,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 12:55:10,816 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459)))) is different from true [2022-07-14 12:55:10,823 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:10,828 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:10,858 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-07-14 12:55:10,865 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467)))) is different from true [2022-07-14 12:55:10,922 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:10,964 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:10,972 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:10,979 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-14 12:55:10,985 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486)))) is different from true [2022-07-14 12:55:11,010 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490)))) is different from true [2022-07-14 12:55:11,018 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:11,025 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-14 12:55:11,031 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:11,038 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:11,045 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-14 12:55:11,052 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-14 12:55:11,059 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504)))) is different from true [2022-07-14 12:55:11,066 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:11,074 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:11,100 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-14 12:55:11,106 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:55:11,113 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516)))) is different from true [2022-07-14 12:55:11,120 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-14 12:55:11,127 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520)))) is different from true [2022-07-14 12:55:11,134 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:11,157 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:11,164 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:55:11,170 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-14 12:55:11,177 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-14 12:55:11,183 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-14 12:55:11,189 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:11,213 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:11,220 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:55:11,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:55:11,243 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 12:55:11,246 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 22 treesize of output 24 [2022-07-14 12:55:11,270 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 25 treesize of output 13 [2022-07-14 12:55:11,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 12:55:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 935 not checked. [2022-07-14 12:55:11,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:55:11,853 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-14 12:55:11,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:55:11,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319880397] [2022-07-14 12:55:11,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319880397] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:55:11,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223015640] [2022-07-14 12:55:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:55:11,858 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:55:11,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:55:11,859 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:55:11,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process