./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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_JEN_test4-3.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 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:28:34,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:28:34,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:28:34,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:28:34,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:28:34,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:28:34,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:28:34,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:28:34,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:28:34,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:28:34,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:28:34,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:28:34,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:28:34,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:28:34,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:28:34,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:28:34,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:28:34,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:28:34,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:28:34,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:28:34,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:28:34,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:28:34,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:28:34,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:28:34,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:28:34,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:28:34,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:28:34,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:28:34,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:28:34,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:28:34,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:28:34,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:28:34,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:28:34,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:28:34,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:28:34,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:28:34,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:28:34,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:28:34,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:28:34,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:28:34,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:28:34,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:28:34,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-13 01:28:34,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:28:34,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:28:34,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:28:34,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:28:34,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:28:34,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:28:34,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:28:34,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:28:34,202 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:28:34,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:28:34,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:28:34,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:28:34,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:28:34,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:28:34,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:28:34,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:28:34,204 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:28:34,205 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:28:34,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:28:34,206 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:28:34,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:28:34,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:28:34,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:28:34,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:28:34,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:28:34,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:28:34,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:28:34,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:28:34,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:28:34,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:28:34,208 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 -> 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 [2022-07-13 01:28:34,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:28:34,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:28:34,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:28:34,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:28:34,469 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:28:34,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-07-13 01:28:34,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f76a010d/d3a1997899d14c72bd97454547cbcf34/FLAG001fe6ca7 [2022-07-13 01:28:35,061 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:28:35,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-07-13 01:28:35,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f76a010d/d3a1997899d14c72bd97454547cbcf34/FLAG001fe6ca7 [2022-07-13 01:28:35,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f76a010d/d3a1997899d14c72bd97454547cbcf34 [2022-07-13 01:28:35,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:28:35,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:28:35,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:28:35,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:28:35,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:28:35,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:28:35" (1/1) ... [2022-07-13 01:28:35,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d81bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:35, skipping insertion in model container [2022-07-13 01:28:35,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:28:35" (1/1) ... [2022-07-13 01:28:35,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:28:35,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:28:35,924 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_JEN_test4-3.i[33021,33034] [2022-07-13 01:28:36,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:28:36,108 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-13 01:28:36,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6faf1a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:36, skipping insertion in model container [2022-07-13 01:28:36,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:28:36,110 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:28:36,112 INFO L158 Benchmark]: Toolchain (without parser) took 593.12ms. Allocated memory is still 121.6MB. Free memory was 91.3MB in the beginning and 83.2MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 01:28:36,113 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:28:36,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.91ms. Allocated memory is still 121.6MB. Free memory was 91.0MB in the beginning and 83.2MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 01:28:36,118 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.18ms. Allocated memory is still 121.6MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.91ms. Allocated memory is still 121.6MB. Free memory was 91.0MB in the beginning and 83.2MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. 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_JEN_test4-3.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 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:28:37,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:28:37,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:28:38,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:28:38,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:28:38,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:28:38,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:28:38,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:28:38,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:28:38,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:28:38,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:28:38,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:28:38,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:28:38,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:28:38,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:28:38,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:28:38,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:28:38,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:28:38,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:28:38,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:28:38,070 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:28:38,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:28:38,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:28:38,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:28:38,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:28:38,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:28:38,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:28:38,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:28:38,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:28:38,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:28:38,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:28:38,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:28:38,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:28:38,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:28:38,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:28:38,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:28:38,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:28:38,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:28:38,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:28:38,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:28:38,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:28:38,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:28:38,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-13 01:28:38,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:28:38,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:28:38,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:28:38,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:28:38,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:28:38,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:28:38,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:28:38,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:28:38,134 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:28:38,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:28:38,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:28:38,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:28:38,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:28:38,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:28:38,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:28:38,146 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:28:38,146 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:28:38,146 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:28:38,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:28:38,147 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:28:38,147 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:28:38,147 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:28:38,147 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:28:38,147 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:28:38,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:28:38,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:28:38,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:28:38,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:28:38,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:28:38,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:28:38,149 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:28:38,149 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:28:38,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:28:38,150 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 -> 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 [2022-07-13 01:28:38,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:28:38,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:28:38,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:28:38,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:28:38,479 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:28:38,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-07-13 01:28:38,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26c3cd0de/32d87fae5dca46f2962e085e547c5855/FLAG7cbb42233 [2022-07-13 01:28:39,099 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:28:39,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2022-07-13 01:28:39,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26c3cd0de/32d87fae5dca46f2962e085e547c5855/FLAG7cbb42233 [2022-07-13 01:28:39,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26c3cd0de/32d87fae5dca46f2962e085e547c5855 [2022-07-13 01:28:39,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:28:39,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:28:39,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:28:39,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:28:39,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:28:39,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:28:39" (1/1) ... [2022-07-13 01:28:39,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fed71a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:39, skipping insertion in model container [2022-07-13 01:28:39,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:28:39" (1/1) ... [2022-07-13 01:28:39,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:28:39,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:28:39,828 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_JEN_test4-3.i[33021,33034] [2022-07-13 01:28:39,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:28:39,990 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:28:40,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:28:40,042 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_JEN_test4-3.i[33021,33034] [2022-07-13 01:28:40,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:28:40,100 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:28:40,136 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_JEN_test4-3.i[33021,33034] [2022-07-13 01:28:40,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:28:40,265 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:28:40,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40 WrapperNode [2022-07-13 01:28:40,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:28:40,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:28:40,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:28:40,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:28:40,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,421 INFO L137 Inliner]: procedures = 180, calls = 448, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1473 [2022-07-13 01:28:40,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:28:40,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:28:40,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:28:40,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:28:40,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:28:40,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:28:40,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:28:40,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:28:40,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (1/1) ... [2022-07-13 01:28:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:28:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:28:40,641 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-13 01:28:40,664 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-13 01:28:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:28:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:28:40,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 01:28:40,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 01:28:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 01:28:40,680 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 01:28:40,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:28:40,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:28:40,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:28:40,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:28:41,014 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:28:41,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:28:41,020 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 01:28:46,600 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:28:46,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:28:46,618 INFO L299 CfgBuilder]: Removed 77 assume(true) statements. [2022-07-13 01:28:46,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:28:46 BoogieIcfgContainer [2022-07-13 01:28:46,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:28:46,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:28:46,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:28:46,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:28:46,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:28:39" (1/3) ... [2022-07-13 01:28:46,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1c3caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:28:46, skipping insertion in model container [2022-07-13 01:28:46,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:28:40" (2/3) ... [2022-07-13 01:28:46,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1c3caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:28:46, skipping insertion in model container [2022-07-13 01:28:46,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:28:46" (3/3) ... [2022-07-13 01:28:46,629 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-3.i [2022-07-13 01:28:46,642 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:28:46,643 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2022-07-13 01:28:46,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:28:46,703 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@1796fc01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b1f7d5 [2022-07-13 01:28:46,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2022-07-13 01:28:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 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-13 01:28:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:28:46,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:46,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:28:46,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-13 01:28:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:46,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453766294] [2022-07-13 01:28:46,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:46,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:46,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:46,739 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-13 01:28:46,777 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-13 01:28:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:46,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 01:28:46,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:46,930 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-13 01:28:46,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:46,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:46,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453766294] [2022-07-13 01:28:46,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453766294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:46,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:46,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:28:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759514425] [2022-07-13 01:28:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:46,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 01:28:46,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:46,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 01:28:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 01:28:46,966 INFO L87 Difference]: Start difference. First operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 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-13 01:28:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:47,047 INFO L93 Difference]: Finished difference Result 1633 states and 1726 transitions. [2022-07-13 01:28:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 01:28:47,049 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-13 01:28:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:47,073 INFO L225 Difference]: With dead ends: 1633 [2022-07-13 01:28:47,073 INFO L226 Difference]: Without dead ends: 1631 [2022-07-13 01:28:47,075 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-13 01:28:47,078 INFO L413 NwaCegarLoop]: 1726 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, 1726 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-13 01:28:47,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:28:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-07-13 01:28:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-07-13 01:28:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 778 states have (on average 2.1748071979434447) internal successors, (1692), 1622 states have internal predecessors, (1692), 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-13 01:28:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1724 transitions. [2022-07-13 01:28:47,204 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1724 transitions. Word has length 5 [2022-07-13 01:28:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:47,204 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 1724 transitions. [2022-07-13 01:28:47,205 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-13 01:28:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1724 transitions. [2022-07-13 01:28:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:28:47,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:47,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:28:47,223 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-13 01:28:47,414 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-13 01:28:47,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-13 01:28:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:47,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767430868] [2022-07-13 01:28:47,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:47,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:47,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:47,418 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-13 01:28:47,421 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-13 01:28:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:47,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:28:47,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:47,625 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-13 01:28:47,646 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-13 01:28:47,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:47,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:47,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767430868] [2022-07-13 01:28:47,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767430868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:47,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:47,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:28:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875554493] [2022-07-13 01:28:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:47,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:28:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:47,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:28:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:28:47,662 INFO L87 Difference]: Start difference. First operand 1631 states and 1724 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-13 01:28:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:50,302 INFO L93 Difference]: Finished difference Result 1668 states and 1774 transitions. [2022-07-13 01:28:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:28:50,303 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-13 01:28:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:50,309 INFO L225 Difference]: With dead ends: 1668 [2022-07-13 01:28:50,309 INFO L226 Difference]: Without dead ends: 1668 [2022-07-13 01:28:50,310 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-13 01:28:50,311 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 1159 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:28:50,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1291 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 01:28:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2022-07-13 01:28:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1614. [2022-07-13 01:28:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 854 states have (on average 2.030444964871194) internal successors, (1734), 1605 states have internal predecessors, (1734), 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-13 01:28:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1766 transitions. [2022-07-13 01:28:50,364 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1766 transitions. Word has length 5 [2022-07-13 01:28:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:50,390 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1766 transitions. [2022-07-13 01:28:50,391 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-13 01:28:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1766 transitions. [2022-07-13 01:28:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:28:50,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:50,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:28:50,406 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-13 01:28:50,592 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-13 01:28:50,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-13 01:28:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579520381] [2022-07-13 01:28:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:50,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:50,597 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-13 01:28:50,599 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-13 01:28:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:50,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:28:50,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:50,744 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-13 01:28:50,766 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-13 01:28:50,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:50,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:50,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579520381] [2022-07-13 01:28:50,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579520381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:50,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:50,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:28:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54350120] [2022-07-13 01:28:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:50,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:28:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:50,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:28:50,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:28:50,772 INFO L87 Difference]: Start difference. First operand 1614 states and 1766 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-13 01:28:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:54,063 INFO L93 Difference]: Finished difference Result 1917 states and 2089 transitions. [2022-07-13 01:28:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:28:54,064 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-13 01:28:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:54,071 INFO L225 Difference]: With dead ends: 1917 [2022-07-13 01:28:54,071 INFO L226 Difference]: Without dead ends: 1917 [2022-07-13 01:28:54,071 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-13 01:28:54,072 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 504 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:28:54,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2076 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-13 01:28:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-07-13 01:28:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1770. [2022-07-13 01:28:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1020 states have (on average 2.0) internal successors, (2040), 1761 states have internal predecessors, (2040), 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-13 01:28:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2072 transitions. [2022-07-13 01:28:54,111 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2072 transitions. Word has length 5 [2022-07-13 01:28:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:54,111 INFO L495 AbstractCegarLoop]: Abstraction has 1770 states and 2072 transitions. [2022-07-13 01:28:54,111 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-13 01:28:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2072 transitions. [2022-07-13 01:28:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:28:54,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:54,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:28:54,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 01:28:54,320 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-13 01:28:54,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-13 01:28:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:54,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992452970] [2022-07-13 01:28:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:54,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:54,325 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-13 01:28:54,327 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-13 01:28:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:54,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:28:54,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:54,444 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-13 01:28:54,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:54,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:54,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992452970] [2022-07-13 01:28:54,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992452970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:54,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:54,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:28:54,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581666210] [2022-07-13 01:28:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:54,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:28:54,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:28:54,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:28:54,447 INFO L87 Difference]: Start difference. First operand 1770 states and 2072 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-13 01:28:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:54,549 INFO L93 Difference]: Finished difference Result 3114 states and 3679 transitions. [2022-07-13 01:28:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:28:54,554 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-13 01:28:54,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:54,565 INFO L225 Difference]: With dead ends: 3114 [2022-07-13 01:28:54,565 INFO L226 Difference]: Without dead ends: 3114 [2022-07-13 01:28:54,566 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-13 01:28:54,567 INFO L413 NwaCegarLoop]: 1900 mSDtfsCounter, 1143 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3516 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:28:54,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3516 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:28:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-13 01:28:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1771. [2022-07-13 01:28:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1021 states have (on average 1.999020568070519) internal successors, (2041), 1762 states have internal predecessors, (2041), 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-13 01:28:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2073 transitions. [2022-07-13 01:28:54,613 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2073 transitions. Word has length 6 [2022-07-13 01:28:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:54,616 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2073 transitions. [2022-07-13 01:28:54,616 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-13 01:28:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2073 transitions. [2022-07-13 01:28:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:28:54,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:54,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:28:54,629 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-13 01:28:54,827 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-13 01:28:54,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-13 01:28:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:54,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146976159] [2022-07-13 01:28:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:54,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:54,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:54,831 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-13 01:28:54,833 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-13 01:28:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:54,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:28:54,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:55,000 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-13 01:28:55,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:55,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:55,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146976159] [2022-07-13 01:28:55,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146976159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:55,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:55,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:28:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598512310] [2022-07-13 01:28:55,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:55,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:28:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:28:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:28:55,003 INFO L87 Difference]: Start difference. First operand 1771 states and 2073 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-13 01:28:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:55,039 INFO L93 Difference]: Finished difference Result 1735 states and 2036 transitions. [2022-07-13 01:28:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:28:55,039 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-13 01:28:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:55,047 INFO L225 Difference]: With dead ends: 1735 [2022-07-13 01:28:55,048 INFO L226 Difference]: Without dead ends: 1735 [2022-07-13 01:28:55,048 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-13 01:28:55,050 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 1533 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1606 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-13 01:28:55,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1606 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:28:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-13 01:28:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1729. [2022-07-13 01:28:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1003 states have (on average 1.992023928215354) internal successors, (1998), 1720 states have internal predecessors, (1998), 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-13 01:28:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2030 transitions. [2022-07-13 01:28:55,088 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2030 transitions. Word has length 11 [2022-07-13 01:28:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:55,088 INFO L495 AbstractCegarLoop]: Abstraction has 1729 states and 2030 transitions. [2022-07-13 01:28:55,089 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-13 01:28:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2030 transitions. [2022-07-13 01:28:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:28:55,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:55,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:28:55,106 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-13 01:28:55,303 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-13 01:28:55,304 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:55,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-13 01:28:55,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:55,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288918552] [2022-07-13 01:28:55,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:55,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:55,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:55,306 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-13 01:28:55,308 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-13 01:28:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:55,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:28:55,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:55,487 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-13 01:28:55,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:55,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:55,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288918552] [2022-07-13 01:28:55,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288918552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:55,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:55,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:28:55,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500204785] [2022-07-13 01:28:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:55,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:28:55,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:28:55,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:28:55,491 INFO L87 Difference]: Start difference. First operand 1729 states and 2030 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-13 01:28:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:55,581 INFO L93 Difference]: Finished difference Result 1714 states and 2008 transitions. [2022-07-13 01:28:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:28:55,582 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-13 01:28:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:55,589 INFO L225 Difference]: With dead ends: 1714 [2022-07-13 01:28:55,589 INFO L226 Difference]: Without dead ends: 1714 [2022-07-13 01:28:55,589 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-13 01:28:55,590 INFO L413 NwaCegarLoop]: 1528 mSDtfsCounter, 1504 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3082 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-13 01:28:55,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3082 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:28:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-07-13 01:28:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1707. [2022-07-13 01:28:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 995 states have (on average 1.9788944723618092) internal successors, (1969), 1698 states have internal predecessors, (1969), 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-13 01:28:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2001 transitions. [2022-07-13 01:28:55,622 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2001 transitions. Word has length 13 [2022-07-13 01:28:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:55,622 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2001 transitions. [2022-07-13 01:28:55,622 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-13 01:28:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2001 transitions. [2022-07-13 01:28:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:28:55,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:55,623 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-13 01:28:55,639 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-13 01:28:55,837 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-13 01:28:55,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:28:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-13 01:28:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:55,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966988451] [2022-07-13 01:28:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:55,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:55,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:55,841 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-13 01:28:55,843 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-13 01:28:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:56,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:28:56,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:56,027 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-13 01:28:56,080 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-13 01:28:56,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:28:56,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:56,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966988451] [2022-07-13 01:28:56,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966988451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:28:56,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:28:56,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:28:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716231026] [2022-07-13 01:28:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:28:56,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:28:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:28:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:28:56,083 INFO L87 Difference]: Start difference. First operand 1707 states and 2001 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-13 01:28:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:59,822 INFO L93 Difference]: Finished difference Result 2520 states and 2820 transitions. [2022-07-13 01:28:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:28:59,822 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-13 01:28:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:59,832 INFO L225 Difference]: With dead ends: 2520 [2022-07-13 01:28:59,833 INFO L226 Difference]: Without dead ends: 2520 [2022-07-13 01:28:59,833 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-13 01:28:59,834 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 2761 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:28:59,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 1876 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-13 01:28:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-07-13 01:28:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1703. [2022-07-13 01:28:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 995 states have (on average 1.9748743718592965) internal successors, (1965), 1694 states have internal predecessors, (1965), 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-13 01:28:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1997 transitions. [2022-07-13 01:28:59,866 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1997 transitions. Word has length 27 [2022-07-13 01:28:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:59,866 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 1997 transitions. [2022-07-13 01:28:59,867 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-13 01:28:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1997 transitions. [2022-07-13 01:28:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:28:59,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:59,868 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-13 01:28:59,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 01:29:00,077 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-13 01:29:00,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:00,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-13 01:29:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:00,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702463296] [2022-07-13 01:29:00,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:00,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:00,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:00,080 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-13 01:29:00,083 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-13 01:29:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:00,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:29:00,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:00,253 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-13 01:29:00,404 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-13 01:29:00,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:00,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:00,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702463296] [2022-07-13 01:29:00,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702463296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:00,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:29:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900759129] [2022-07-13 01:29:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:00,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:29:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:00,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:29:00,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:29:00,406 INFO L87 Difference]: Start difference. First operand 1703 states and 1997 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-13 01:29:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:04,328 INFO L93 Difference]: Finished difference Result 2264 states and 2467 transitions. [2022-07-13 01:29:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:29:04,328 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-13 01:29:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:04,334 INFO L225 Difference]: With dead ends: 2264 [2022-07-13 01:29:04,335 INFO L226 Difference]: Without dead ends: 2264 [2022-07-13 01:29:04,335 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-13 01:29:04,336 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1247 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:04,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2536 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-13 01:29:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-07-13 01:29:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1699. [2022-07-13 01:29:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 995 states have (on average 1.9708542713567838) internal successors, (1961), 1690 states have internal predecessors, (1961), 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-13 01:29:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1993 transitions. [2022-07-13 01:29:04,364 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1993 transitions. Word has length 27 [2022-07-13 01:29:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:04,365 INFO L495 AbstractCegarLoop]: Abstraction has 1699 states and 1993 transitions. [2022-07-13 01:29:04,365 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-13 01:29:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1993 transitions. [2022-07-13 01:29:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 01:29:04,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:04,366 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-13 01:29:04,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 01:29:04,575 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-13 01:29:04,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-13 01:29:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:04,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535900467] [2022-07-13 01:29:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:04,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:04,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:04,578 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-13 01:29:04,579 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-13 01:29:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:04,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:29:04,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:04,831 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-13 01:29:04,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:04,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:04,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535900467] [2022-07-13 01:29:04,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535900467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:04,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:04,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:29:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576559884] [2022-07-13 01:29:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:29:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:29:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:29:04,836 INFO L87 Difference]: Start difference. First operand 1699 states and 1993 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-13 01:29:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:04,893 INFO L93 Difference]: Finished difference Result 1699 states and 1989 transitions. [2022-07-13 01:29:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:29:04,893 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-13 01:29:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:04,899 INFO L225 Difference]: With dead ends: 1699 [2022-07-13 01:29:04,899 INFO L226 Difference]: Without dead ends: 1699 [2022-07-13 01:29:04,900 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-13 01:29:04,902 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 1480 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 3060 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-13 01:29:04,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 3060 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:29:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-07-13 01:29:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1693. [2022-07-13 01:29:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 989 states have (on average 1.9726996966632964) internal successors, (1951), 1684 states have internal predecessors, (1951), 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-13 01:29:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1983 transitions. [2022-07-13 01:29:04,948 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1983 transitions. Word has length 42 [2022-07-13 01:29:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:04,950 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 1983 transitions. [2022-07-13 01:29:04,950 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-13 01:29:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1983 transitions. [2022-07-13 01:29:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 01:29:04,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:04,954 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-13 01:29:04,970 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-13 01:29:05,166 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-13 01:29:05,166 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-13 01:29:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:05,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024187043] [2022-07-13 01:29:05,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:05,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:05,168 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-13 01:29:05,172 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-13 01:29:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:05,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:29:05,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:05,572 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-13 01:29:05,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:05,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:05,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024187043] [2022-07-13 01:29:05,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024187043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:05,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:05,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:29:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692097566] [2022-07-13 01:29:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:05,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:29:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:29:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:29:05,574 INFO L87 Difference]: Start difference. First operand 1693 states and 1983 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-13 01:29:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:05,740 INFO L93 Difference]: Finished difference Result 2112 states and 2419 transitions. [2022-07-13 01:29:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:29:05,741 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-13 01:29:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:05,749 INFO L225 Difference]: With dead ends: 2112 [2022-07-13 01:29:05,749 INFO L226 Difference]: Without dead ends: 2112 [2022-07-13 01:29:05,750 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-13 01:29:05,750 INFO L413 NwaCegarLoop]: 1600 mSDtfsCounter, 455 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:05,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2996 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:29:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-07-13 01:29:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1739. [2022-07-13 01:29:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1035 states have (on average 1.9294685990338165) internal successors, (1997), 1730 states have internal predecessors, (1997), 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-13 01:29:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2029 transitions. [2022-07-13 01:29:05,782 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2029 transitions. Word has length 50 [2022-07-13 01:29:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:05,782 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2029 transitions. [2022-07-13 01:29:05,782 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-13 01:29:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2029 transitions. [2022-07-13 01:29:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 01:29:05,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:05,786 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-13 01:29:05,802 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-13 01:29:05,998 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-13 01:29:05,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-13 01:29:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149764718] [2022-07-13 01:29:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:05,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:05,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:06,001 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-13 01:29:06,003 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-13 01:29:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:06,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:29:06,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:06,339 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-13 01:29:06,348 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-13 01:29:06,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:29:06,693 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-13 01:29:06,705 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:29:06,706 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-13 01:29:06,721 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-13 01:29:06,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:06,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:06,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149764718] [2022-07-13 01:29:06,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149764718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:06,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:06,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:29:06,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491019062] [2022-07-13 01:29:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:06,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:29:06,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:06,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:29:06,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:29:06,724 INFO L87 Difference]: Start difference. First operand 1739 states and 2029 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-13 01:29:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:09,288 INFO L93 Difference]: Finished difference Result 1708 states and 1952 transitions. [2022-07-13 01:29:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:29:09,288 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-13 01:29:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:09,293 INFO L225 Difference]: With dead ends: 1708 [2022-07-13 01:29:09,293 INFO L226 Difference]: Without dead ends: 1708 [2022-07-13 01:29:09,294 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-13 01:29:09,294 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 1095 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:09,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1218 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 01:29:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-07-13 01:29:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1489. [2022-07-13 01:29:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 869 states have (on average 1.8365937859608745) internal successors, (1596), 1480 states have internal predecessors, (1596), 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-13 01:29:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1628 transitions. [2022-07-13 01:29:09,314 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1628 transitions. Word has length 53 [2022-07-13 01:29:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:09,314 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1628 transitions. [2022-07-13 01:29:09,315 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-13 01:29:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1628 transitions. [2022-07-13 01:29:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:29:09,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:09,316 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-13 01:29:09,329 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-13 01:29:09,529 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-13 01:29:09,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-13 01:29:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:09,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623661464] [2022-07-13 01:29:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:09,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:09,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:09,532 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-13 01:29:09,533 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-13 01:29:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:09,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:29:09,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:09,770 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-13 01:29:09,783 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-13 01:29:09,809 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-13 01:29:09,821 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-13 01:29:09,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:09,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623661464] [2022-07-13 01:29:09,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623661464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:09,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:09,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:29:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529065397] [2022-07-13 01:29:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:09,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:29:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:29:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:29:09,824 INFO L87 Difference]: Start difference. First operand 1489 states and 1628 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-13 01:29:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:12,424 INFO L93 Difference]: Finished difference Result 1488 states and 1627 transitions. [2022-07-13 01:29:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:29:12,424 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-13 01:29:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:12,429 INFO L225 Difference]: With dead ends: 1488 [2022-07-13 01:29:12,429 INFO L226 Difference]: Without dead ends: 1488 [2022-07-13 01:29:12,429 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-13 01:29:12,430 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 4 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:12,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3630 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 01:29:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-13 01:29:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-07-13 01:29:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 869 states have (on average 1.8354430379746836) internal successors, (1595), 1479 states have internal predecessors, (1595), 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-13 01:29:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1627 transitions. [2022-07-13 01:29:12,450 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1627 transitions. Word has length 58 [2022-07-13 01:29:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:12,450 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1627 transitions. [2022-07-13 01:29:12,451 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-13 01:29:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1627 transitions. [2022-07-13 01:29:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:29:12,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:12,452 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-13 01:29:12,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 01:29:12,663 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-13 01:29:12,664 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-13 01:29:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:12,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421390265] [2022-07-13 01:29:12,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:12,667 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-13 01:29:12,669 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-13 01:29:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:12,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:29:12,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:12,934 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-13 01:29:12,957 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-13 01:29:12,967 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-13 01:29:13,020 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-13 01:29:13,026 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-13 01:29:13,042 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-13 01:29:13,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:13,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421390265] [2022-07-13 01:29:13,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421390265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:13,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:13,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:29:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17460731] [2022-07-13 01:29:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:13,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:29:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:29:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:29:13,045 INFO L87 Difference]: Start difference. First operand 1488 states and 1627 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-13 01:29:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:16,647 INFO L93 Difference]: Finished difference Result 1487 states and 1626 transitions. [2022-07-13 01:29:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:29:16,648 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-13 01:29:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:16,651 INFO L225 Difference]: With dead ends: 1487 [2022-07-13 01:29:16,652 INFO L226 Difference]: Without dead ends: 1487 [2022-07-13 01:29:16,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:29:16,652 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:16,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3681 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-13 01:29:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-13 01:29:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2022-07-13 01:29:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 868 states have (on average 1.836405529953917) internal successors, (1594), 1478 states have internal predecessors, (1594), 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-13 01:29:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1626 transitions. [2022-07-13 01:29:16,671 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1626 transitions. Word has length 58 [2022-07-13 01:29:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:16,672 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 1626 transitions. [2022-07-13 01:29:16,672 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-13 01:29:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1626 transitions. [2022-07-13 01:29:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:29:16,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:16,673 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-13 01:29:16,687 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-13 01:29:16,884 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-13 01:29:16,885 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1222950270, now seen corresponding path program 1 times [2022-07-13 01:29:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:16,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508036528] [2022-07-13 01:29:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:16,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:16,887 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-13 01:29:16,888 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-13 01:29:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:17,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:29:17,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:17,151 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-13 01:29:17,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:29:17,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:17,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508036528] [2022-07-13 01:29:17,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508036528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:29:17,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:29:17,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:29:17,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107601942] [2022-07-13 01:29:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:29:17,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:29:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:29:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:29:17,154 INFO L87 Difference]: Start difference. First operand 1487 states and 1626 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-13 01:29:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:17,217 INFO L93 Difference]: Finished difference Result 1490 states and 1631 transitions. [2022-07-13 01:29:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:29:17,218 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-13 01:29:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:17,226 INFO L225 Difference]: With dead ends: 1490 [2022-07-13 01:29:17,226 INFO L226 Difference]: Without dead ends: 1490 [2022-07-13 01:29:17,227 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-13 01:29:17,227 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4315 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-13 01:29:17,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:29:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-13 01:29:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2022-07-13 01:29:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 870 states have (on average 1.835632183908046) internal successors, (1597), 1481 states have internal predecessors, (1597), 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-13 01:29:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1631 transitions. [2022-07-13 01:29:17,254 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1631 transitions. Word has length 66 [2022-07-13 01:29:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:17,254 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 1631 transitions. [2022-07-13 01:29:17,255 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-13 01:29:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1631 transitions. [2022-07-13 01:29:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:29:17,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:17,256 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-13 01:29:17,275 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-13 01:29:17,467 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-13 01:29:17,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash -428715873, now seen corresponding path program 1 times [2022-07-13 01:29:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298817556] [2022-07-13 01:29:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:29:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:17,470 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-13 01:29:17,472 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-13 01:29:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:29:17,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:29:17,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:17,737 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-13 01:29:17,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:29:17,800 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-13 01:29:17,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:17,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298817556] [2022-07-13 01:29:17,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298817556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:29:17,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:29:17,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 01:29:17,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629355237] [2022-07-13 01:29:17,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:29:17,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:29:17,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:17,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:29:17,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:29:17,803 INFO L87 Difference]: Start difference. First operand 1490 states and 1631 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-13 01:29:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:17,972 INFO L93 Difference]: Finished difference Result 1502 states and 1649 transitions. [2022-07-13 01:29:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:29:17,973 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-13 01:29:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:17,977 INFO L225 Difference]: With dead ends: 1502 [2022-07-13 01:29:17,977 INFO L226 Difference]: Without dead ends: 1502 [2022-07-13 01:29:17,977 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-13 01:29:17,978 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 15 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:17,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7178 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:29:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-07-13 01:29:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1500. [2022-07-13 01:29:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 879 states have (on average 1.8339021615472126) internal successors, (1612), 1490 states have internal predecessors, (1612), 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-13 01:29:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1646 transitions. [2022-07-13 01:29:18,005 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1646 transitions. Word has length 67 [2022-07-13 01:29:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:18,005 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 1646 transitions. [2022-07-13 01:29:18,005 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-13 01:29:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1646 transitions. [2022-07-13 01:29:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 01:29:18,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:18,006 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-13 01:29:18,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-13 01:29:18,219 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-13 01:29:18,220 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 155254206, now seen corresponding path program 2 times [2022-07-13 01:29:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:18,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800868968] [2022-07-13 01:29:18,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:29:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:18,222 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-13 01:29:18,223 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-13 01:29:18,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:29:18,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:29:18,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:29:18,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:18,656 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-13 01:29:18,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:29:18,831 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-13 01:29:18,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800868968] [2022-07-13 01:29:18,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800868968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:29:18,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:29:18,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 01:29:18,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473530634] [2022-07-13 01:29:18,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:29:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:29:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:29:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:29:18,833 INFO L87 Difference]: Start difference. First operand 1500 states and 1646 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-13 01:29:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:19,559 INFO L93 Difference]: Finished difference Result 1521 states and 1678 transitions. [2022-07-13 01:29:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 01:29:19,560 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-13 01:29:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:19,564 INFO L225 Difference]: With dead ends: 1521 [2022-07-13 01:29:19,564 INFO L226 Difference]: Without dead ends: 1517 [2022-07-13 01:29:19,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-13 01:29:19,565 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 44 mSDsluCounter, 11498 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:19,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12942 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:29:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2022-07-13 01:29:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2022-07-13 01:29:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 888 states have (on average 1.8288288288288288) internal successors, (1624), 1499 states have internal predecessors, (1624), 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-13 01:29:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1658 transitions. [2022-07-13 01:29:19,586 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1658 transitions. Word has length 70 [2022-07-13 01:29:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:19,586 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1658 transitions. [2022-07-13 01:29:19,587 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-13 01:29:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1658 transitions. [2022-07-13 01:29:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:29:19,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:19,588 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-13 01:29:19,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-13 01:29:19,800 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-13 01:29:19,801 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash -392207842, now seen corresponding path program 3 times [2022-07-13 01:29:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:19,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068580950] [2022-07-13 01:29:19,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:29:19,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:19,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:19,803 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-13 01:29:19,805 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-13 01:29:20,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 01:29:20,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:29:20,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:29:20,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:20,534 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-13 01:29:20,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:29:21,156 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-13 01:29:21,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:21,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068580950] [2022-07-13 01:29:21,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068580950] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:29:21,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:29:21,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 01:29:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770112839] [2022-07-13 01:29:21,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:29:21,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:29:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:29:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:29:21,158 INFO L87 Difference]: Start difference. First operand 1509 states and 1658 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-13 01:29:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:24,053 INFO L93 Difference]: Finished difference Result 1551 states and 1734 transitions. [2022-07-13 01:29:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 01:29:24,054 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-13 01:29:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:24,058 INFO L225 Difference]: With dead ends: 1551 [2022-07-13 01:29:24,058 INFO L226 Difference]: Without dead ends: 1545 [2022-07-13 01:29:24,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 01:29:24,060 INFO L413 NwaCegarLoop]: 1448 mSDtfsCounter, 162 mSDsluCounter, 15872 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 17320 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:24,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 17320 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 01:29:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-07-13 01:29:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1527. [2022-07-13 01:29:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 906 states have (on average 1.8178807947019868) internal successors, (1647), 1517 states have internal predecessors, (1647), 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-13 01:29:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1681 transitions. [2022-07-13 01:29:24,105 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1681 transitions. Word has length 76 [2022-07-13 01:29:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:24,105 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 1681 transitions. [2022-07-13 01:29:24,106 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-13 01:29:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1681 transitions. [2022-07-13 01:29:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 01:29:24,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:24,107 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-13 01:29:24,127 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-13 01:29:24,322 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-13 01:29:24,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1896075998, now seen corresponding path program 4 times [2022-07-13 01:29:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:24,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905419344] [2022-07-13 01:29:24,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 01:29:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:24,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:24,325 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-13 01:29:24,327 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-13 01:29:24,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 01:29:24,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:29:24,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:29:24,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:24,977 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-13 01:29:24,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:29:26,355 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-13 01:29:26,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905419344] [2022-07-13 01:29:26,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905419344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:29:26,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:29:26,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 01:29:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134585622] [2022-07-13 01:29:26,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:29:26,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:29:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:29:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:29:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:29:26,359 INFO L87 Difference]: Start difference. First operand 1527 states and 1681 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-13 01:29:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:29:37,634 INFO L93 Difference]: Finished difference Result 1607 states and 1814 transitions. [2022-07-13 01:29:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-13 01:29:37,635 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-13 01:29:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:29:37,638 INFO L225 Difference]: With dead ends: 1607 [2022-07-13 01:29:37,639 INFO L226 Difference]: Without dead ends: 1603 [2022-07-13 01:29:37,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 01:29:37,642 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 416 mSDsluCounter, 34926 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 36387 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:29:37,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 36387 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:29:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2022-07-13 01:29:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1561. [2022-07-13 01:29:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 940 states have (on average 1.8010638297872341) internal successors, (1693), 1551 states have internal predecessors, (1693), 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-13 01:29:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1727 transitions. [2022-07-13 01:29:37,668 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1727 transitions. Word has length 88 [2022-07-13 01:29:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:29:37,669 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1727 transitions. [2022-07-13 01:29:37,669 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-13 01:29:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1727 transitions. [2022-07-13 01:29:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 01:29:37,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:29:37,670 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-13 01:29:37,687 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-13 01:29:37,885 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-13 01:29:37,885 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:29:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:29:37,885 INFO L85 PathProgramCache]: Analyzing trace with hash 202285118, now seen corresponding path program 5 times [2022-07-13 01:29:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:29:37,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291767207] [2022-07-13 01:29:37,886 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:29:37,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:29:37,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:29:37,887 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-13 01:29:37,890 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-13 01:29:39,176 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:29:39,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:29:39,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 01:29:39,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:29:39,238 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:29:39,239 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-13 01:29:39,579 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-13 01:29:39,580 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-13 01:29:39,647 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-13 01:29:39,785 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 43 treesize of output 25 [2022-07-13 01:29:40,097 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1564)))) is different from true [2022-07-13 01:29:40,244 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1568 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1568) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:29:40,482 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1575 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1575)))) is different from true [2022-07-13 01:29:40,581 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1578)))) is different from true [2022-07-13 01:29:40,636 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1580) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:29:40,651 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-07-13 01:29:40,702 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1583)))) is different from true [2022-07-13 01:29:40,716 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1584)))) is different from true [2022-07-13 01:29:40,929 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1590) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:29:40,948 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1591)))) is different from true [2022-07-13 01:29:40,962 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (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-13 01:29:41,200 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1599) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:29:41,214 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:29:41,299 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (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)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (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-13 01:29:41,423 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:29:41,424 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 55 treesize of output 54 [2022-07-13 01:29:41,482 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 52 treesize of output 28 [2022-07-13 01:29:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 525 not checked. [2022-07-13 01:29:41,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:29:41,847 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-13 01:29:41,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:29:41,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291767207] [2022-07-13 01:29:41,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291767207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:29:41,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [920974547] [2022-07-13 01:29:41,850 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:29:41,850 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:29:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:29:41,857 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-13 01:29:41,860 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-13 01:31:07,188 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:31:07,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:31:07,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 01:31:07,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:31:07,476 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:31:07,477 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-13 01:31:07,693 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-13 01:31:07,693 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-13 01:31:07,743 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-13 01:31:07,929 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-13 01:31:10,425 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:31:10,426 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-13 01:31:10,503 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-13 01:31:10,562 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-13 01:31:10,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:31:10,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (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_2097) |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-13 01:31:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [920974547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:31:10,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:31:10,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8] total 30 [2022-07-13 01:31:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113805176] [2022-07-13 01:31:10,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:31:10,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 01:31:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:31:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 01:31:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=316, Unknown=38, NotChecked=816, Total=1260 [2022-07-13 01:31:10,802 INFO L87 Difference]: Start difference. First operand 1561 states and 1727 transitions. Second operand has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 31 states have internal predecessors, (155), 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-13 01:31:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:31:19,802 INFO L93 Difference]: Finished difference Result 2846 states and 3093 transitions. [2022-07-13 01:31:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 01:31:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 31 states have internal predecessors, (155), 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-13 01:31:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:31:19,807 INFO L225 Difference]: With dead ends: 2846 [2022-07-13 01:31:19,807 INFO L226 Difference]: Without dead ends: 2842 [2022-07-13 01:31:19,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 118 SyntacticMatches, 77 SemanticMatches, 45 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=197, Invalid=737, Unknown=60, NotChecked=1168, Total=2162 [2022-07-13 01:31:19,809 INFO L413 NwaCegarLoop]: 1004 mSDtfsCounter, 1376 mSDsluCounter, 8079 mSDsCounter, 0 mSdLazyCounter, 6890 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 9083 SdHoareTripleChecker+Invalid, 35816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 6890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28891 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:31:19,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 9083 Invalid, 35816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 6890 Invalid, 0 Unknown, 28891 Unchecked, 8.2s Time] [2022-07-13 01:31:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2022-07-13 01:31:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1923. [2022-07-13 01:31:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1300 states have (on average 1.7407692307692308) internal successors, (2263), 1908 states have internal predecessors, (2263), 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-13 01:31:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2305 transitions. [2022-07-13 01:31:19,844 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2305 transitions. Word has length 110 [2022-07-13 01:31:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:31:19,844 INFO L495 AbstractCegarLoop]: Abstraction has 1923 states and 2305 transitions. [2022-07-13 01:31:19,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.344827586206897) internal successors, (155), 31 states have internal predecessors, (155), 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-13 01:31:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2305 transitions. [2022-07-13 01:31:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 01:31:19,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:31:19,846 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-13 01:31:19,871 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-13 01:31:20,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-13 01:31:20,258 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-13 01:31:20,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-13 01:31:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:31:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 202285119, now seen corresponding path program 1 times [2022-07-13 01:31:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:31:20,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179214934] [2022-07-13 01:31:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:31:20,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:31:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:31:20,261 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-13 01:31:20,262 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-13 01:31:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:31:21,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-13 01:31:21,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:31:21,124 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-13 01:31:21,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:31:21,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:31:21,304 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-13 01:31:21,324 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-13 01:31:21,333 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-13 01:31:21,428 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-13 01:31:21,432 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-13 01:31:21,479 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-07-13 01:31:21,501 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-07-13 01:31:21,512 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:31:21,573 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:31:21,581 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,597 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471)))) is different from true [2022-07-13 01:31:21,606 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-13 01:31:21,615 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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|))) is different from true [2022-07-13 01:31:21,624 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477)))) is different from true [2022-07-13 01:31:21,652 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:31:21,664 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:31:21,672 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-13 01:31:21,682 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:31:21,690 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,700 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491)))) is different from true [2022-07-13 01:31:21,709 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,717 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-13 01:31:21,726 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,734 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498)))) is different from true [2022-07-13 01:31:21,741 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,753 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,764 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,801 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,811 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-13 01:31:21,822 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,832 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_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ 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-13 01:31:21,842 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517)))) is different from true [2022-07-13 01:31:21,852 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,863 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-13 01:31:21,873 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,884 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:31:21,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-13 01:31:21,904 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,915 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,926 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,936 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (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_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-13 01:31:21,946 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-13 01:31:21,956 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,967 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:21,977 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:31:22,011 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:31:22,012 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-13 01:31:22,017 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-13 01:31:22,063 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-13 01:31:22,068 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-13 01:31:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 980 not checked. [2022-07-13 01:31:22,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:31:22,870 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-13 01:31:22,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:31:22,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179214934] [2022-07-13 01:31:22,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179214934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:31:22,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681652486] [2022-07-13 01:31:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:31:22,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:31:22,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:31:22,880 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-13 01:31:22,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process