./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-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 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:34:23,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:34:23,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:34:23,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:34:23,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:34:23,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:34:23,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:34:23,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:34:23,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:34:23,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:34:23,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:34:23,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:34:23,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:34:23,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:34:23,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:34:23,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:34:23,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:34:23,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:34:23,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:34:23,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:34:23,157 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:34:23,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:34:23,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:34:23,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:34:23,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:34:23,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:34:23,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:34:23,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:34:23,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:34:23,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:34:23,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:34:23,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:34:23,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:34:23,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:34:23,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:34:23,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:34:23,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:34:23,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:34:23,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:34:23,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:34:23,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:34:23,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:34:23,178 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 12:34:23,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:34:23,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:34:23,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:34:23,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:34:23,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:34:23,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:34:23,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:34:23,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:34:23,213 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:34:23,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:34:23,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:34:23,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:34:23,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:34:23,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:34:23,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:34:23,217 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:34:23,217 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:34:23,217 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:34:23,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:34:23,218 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:34:23,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:34:23,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:34:23,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:34:23,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:34:23,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:34:23,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:34:23,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:34:23,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:34:23,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:34:23,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:34:23,220 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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2022-07-23 12:34:23,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:34:23,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:34:23,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:34:23,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:34:23,465 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:34:23,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2022-07-23 12:34:23,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88946fdd2/886db086b6e34d5f99e1ee88f04b451e/FLAG6fbd9cd4c [2022-07-23 12:34:24,004 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:34:24,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2022-07-23 12:34:24,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88946fdd2/886db086b6e34d5f99e1ee88f04b451e/FLAG6fbd9cd4c [2022-07-23 12:34:24,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88946fdd2/886db086b6e34d5f99e1ee88f04b451e [2022-07-23 12:34:24,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:34:24,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:34:24,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:34:24,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:34:24,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:34:24,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:34:24" (1/1) ... [2022-07-23 12:34:24,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a259200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:24, skipping insertion in model container [2022-07-23 12:34:24,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:34:24" (1/1) ... [2022-07-23 12:34:24,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:34:24,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:34:24,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[33021,33034] [2022-07-23 12:34:24,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[49681,49694] [2022-07-23 12:34:24,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:34:24,569 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-23 12:34:24,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e23fa8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:24, skipping insertion in model container [2022-07-23 12:34:24,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:34:24,570 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:34:24,572 INFO L158 Benchmark]: Toolchain (without parser) took 526.66ms. Allocated memory is still 90.2MB. Free memory was 66.3MB in the beginning and 50.1MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-23 12:34:24,572 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:34:24,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.73ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 50.3MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-23 12:34:24,574 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.19ms. Allocated memory is still 90.2MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.73ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 50.3MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-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 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:34:26,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:34:26,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:34:26,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:34:26,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:34:26,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:34:26,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:34:26,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:34:26,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:34:26,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:34:26,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:34:26,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:34:26,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:34:26,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:34:26,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:34:26,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:34:26,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:34:26,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:34:26,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:34:26,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:34:26,392 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:34:26,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:34:26,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:34:26,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:34:26,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:34:26,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:34:26,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:34:26,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:34:26,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:34:26,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:34:26,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:34:26,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:34:26,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:34:26,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:34:26,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:34:26,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:34:26,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:34:26,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:34:26,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:34:26,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:34:26,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:34:26,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:34:26,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 12:34:26,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:34:26,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:34:26,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:34:26,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:34:26,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:34:26,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:34:26,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:34:26,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:34:26,429 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:34:26,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:34:26,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:34:26,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:34:26,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:34:26,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:34:26,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:34:26,431 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:34:26,431 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:34:26,431 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:34:26,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:34:26,431 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:34:26,432 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:34:26,432 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:34:26,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:34:26,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:34:26,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:34:26,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:34:26,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:34:26,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:34:26,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:34:26,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:34:26,433 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:34:26,434 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:34:26,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:34:26,434 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 -> 5b724500cddd07446974ec59df8ac86aa980f4ff713324fa73d397377235cbe2 [2022-07-23 12:34:26,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:34:26,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:34:26,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:34:26,747 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:34:26,748 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:34:26,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2022-07-23 12:34:26,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b8b918a/1e2195547f4c4d538dabacb235ce48a5/FLAGb30ef552b [2022-07-23 12:34:27,374 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:34:27,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i [2022-07-23 12:34:27,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b8b918a/1e2195547f4c4d538dabacb235ce48a5/FLAGb30ef552b [2022-07-23 12:34:27,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b8b918a/1e2195547f4c4d538dabacb235ce48a5 [2022-07-23 12:34:27,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:34:27,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:34:27,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:34:27,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:34:27,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:34:27,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:34:27" (1/1) ... [2022-07-23 12:34:27,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@daa79d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:27, skipping insertion in model container [2022-07-23 12:34:27,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:34:27" (1/1) ... [2022-07-23 12:34:27,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:34:27,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:34:28,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[33021,33034] [2022-07-23 12:34:28,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[49681,49694] [2022-07-23 12:34:28,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:34:28,183 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:34:28,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:34:28,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[33021,33034] [2022-07-23 12:34:28,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[49681,49694] [2022-07-23 12:34:28,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:34:28,294 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:34:28,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[33021,33034] [2022-07-23 12:34:28,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-3.i[49681,49694] [2022-07-23 12:34:28,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:34:28,467 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:34:28,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28 WrapperNode [2022-07-23 12:34:28,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:34:28,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:34:28,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:34:28,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:34:28,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,632 INFO L137 Inliner]: procedures = 180, calls = 487, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1721 [2022-07-23 12:34:28,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:34:28,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:34:28,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:34:28,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:34:28,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:34:28,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:34:28,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:34:28,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:34:28,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (1/1) ... [2022-07-23 12:34:28,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:34:28,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:34:28,809 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-23 12:34:28,831 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-23 12:34:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 12:34:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 12:34:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 12:34:28,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 12:34:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 12:34:28,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 12:34:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:34:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:34:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:34:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 12:34:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 12:34:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:34:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:34:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 12:34:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:34:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:34:28,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:34:29,211 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:34:29,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:34:29,218 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 12:34:35,338 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:34:35,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:34:35,362 INFO L299 CfgBuilder]: Removed 100 assume(true) statements. [2022-07-23 12:34:35,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:34:35 BoogieIcfgContainer [2022-07-23 12:34:35,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:34:35,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:34:35,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:34:35,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:34:35,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:34:27" (1/3) ... [2022-07-23 12:34:35,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc3035e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:34:35, skipping insertion in model container [2022-07-23 12:34:35,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:34:28" (2/3) ... [2022-07-23 12:34:35,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc3035e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:34:35, skipping insertion in model container [2022-07-23 12:34:35,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:34:35" (3/3) ... [2022-07-23 12:34:35,376 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-3.i [2022-07-23 12:34:35,389 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:34:35,390 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 932 error locations. [2022-07-23 12:34:35,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:34:35,480 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@1206e042, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46597432 [2022-07-23 12:34:35,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 932 error locations. [2022-07-23 12:34:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:34:35,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:35,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:34:35,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-23 12:34:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:35,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828993087] [2022-07-23 12:34:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:35,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:35,523 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-23 12:34:35,536 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-23 12:34:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:35,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-23 12:34:35,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:35,788 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-23 12:34:35,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:35,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:35,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828993087] [2022-07-23 12:34:35,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828993087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:35,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:35,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:34:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812915868] [2022-07-23 12:34:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:35,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 12:34:35,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 12:34:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 12:34:35,839 INFO L87 Difference]: Start difference. First operand has 1833 states, 893 states have (on average 2.2642777155655094) internal successors, (2022), 1824 states have internal predecessors, (2022), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) 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-23 12:34:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:35,929 INFO L93 Difference]: Finished difference Result 1815 states and 1917 transitions. [2022-07-23 12:34:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 12:34:35,932 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-23 12:34:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:35,964 INFO L225 Difference]: With dead ends: 1815 [2022-07-23 12:34:35,965 INFO L226 Difference]: Without dead ends: 1813 [2022-07-23 12:34:35,966 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-23 12:34:35,970 INFO L413 NwaCegarLoop]: 1917 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, 1917 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-23 12:34:35,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:34:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-07-23 12:34:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2022-07-23 12:34:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 884 states have (on average 2.1414027149321266) internal successors, (1893), 1804 states have internal predecessors, (1893), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 1915 transitions. [2022-07-23 12:34:36,081 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 1915 transitions. Word has length 5 [2022-07-23 12:34:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:36,081 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 1915 transitions. [2022-07-23 12:34:36,082 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-23 12:34:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 1915 transitions. [2022-07-23 12:34:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:34:36,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:36,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:34:36,098 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-23 12:34:36,294 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-23 12:34:36,295 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-23 12:34:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:36,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301453844] [2022-07-23 12:34:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:36,298 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-23 12:34:36,300 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-23 12:34:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:36,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:34:36,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:36,553 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-23 12:34:36,564 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-23 12:34:36,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:36,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:36,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301453844] [2022-07-23 12:34:36,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301453844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:34:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139557552] [2022-07-23 12:34:36,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:34:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:34:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:34:36,568 INFO L87 Difference]: Start difference. First operand 1813 states and 1915 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-23 12:34:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:39,314 INFO L93 Difference]: Finished difference Result 2069 states and 2214 transitions. [2022-07-23 12:34:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:34:39,315 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-23 12:34:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:39,323 INFO L225 Difference]: With dead ends: 2069 [2022-07-23 12:34:39,323 INFO L226 Difference]: Without dead ends: 2069 [2022-07-23 12:34:39,324 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-23 12:34:39,325 INFO L413 NwaCegarLoop]: 1354 mSDtfsCounter, 1369 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-23 12:34:39,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1809 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-23 12:34:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2022-07-23 12:34:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1798. [2022-07-23 12:34:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 960 states have (on average 2.017708333333333) internal successors, (1937), 1789 states have internal predecessors, (1937), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 1959 transitions. [2022-07-23 12:34:39,383 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 1959 transitions. Word has length 5 [2022-07-23 12:34:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:39,383 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 1959 transitions. [2022-07-23 12:34:39,383 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-23 12:34:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 1959 transitions. [2022-07-23 12:34:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 12:34:39,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:39,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 12:34:39,399 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-23 12:34:39,593 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-23 12:34:39,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-23 12:34:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:39,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235121124] [2022-07-23 12:34:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:39,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:39,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:39,600 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-23 12:34:39,602 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-23 12:34:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:39,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:34:39,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:39,761 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-23 12:34:39,779 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-23 12:34:39,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:39,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235121124] [2022-07-23 12:34:39,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235121124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:39,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:39,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:34:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154279226] [2022-07-23 12:34:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:39,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:34:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:34:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:34:39,782 INFO L87 Difference]: Start difference. First operand 1798 states and 1959 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-23 12:34:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:43,199 INFO L93 Difference]: Finished difference Result 2318 states and 2529 transitions. [2022-07-23 12:34:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:34:43,200 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-23 12:34:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:43,208 INFO L225 Difference]: With dead ends: 2318 [2022-07-23 12:34:43,209 INFO L226 Difference]: Without dead ends: 2318 [2022-07-23 12:34:43,209 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-23 12:34:43,210 INFO L413 NwaCegarLoop]: 1746 mSDtfsCounter, 741 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:34:43,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2548 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 12:34:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-07-23 12:34:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1954. [2022-07-23 12:34:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1126 states have (on average 1.992007104795737) internal successors, (2243), 1945 states have internal predecessors, (2243), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2265 transitions. [2022-07-23 12:34:43,249 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2265 transitions. Word has length 5 [2022-07-23 12:34:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:43,250 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2265 transitions. [2022-07-23 12:34:43,250 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-23 12:34:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2265 transitions. [2022-07-23 12:34:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 12:34:43,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:43,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 12:34:43,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-23 12:34:43,458 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-23 12:34:43,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-23 12:34:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:43,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986020152] [2022-07-23 12:34:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:43,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:43,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:43,462 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-23 12:34:43,464 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-23 12:34:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:43,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:34:43,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:43,603 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-23 12:34:43,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:43,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:43,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986020152] [2022-07-23 12:34:43,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986020152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:43,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:43,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:34:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661417120] [2022-07-23 12:34:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:43,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:34:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:34:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:34:43,606 INFO L87 Difference]: Start difference. First operand 1954 states and 2265 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-23 12:34:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:43,744 INFO L93 Difference]: Finished difference Result 3514 states and 4117 transitions. [2022-07-23 12:34:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:34:43,749 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-23 12:34:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:43,762 INFO L225 Difference]: With dead ends: 3514 [2022-07-23 12:34:43,762 INFO L226 Difference]: Without dead ends: 3514 [2022-07-23 12:34:43,763 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-23 12:34:43,766 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 1377 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 4069 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:34:43,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 4069 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:34:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-07-23 12:34:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 1956. [2022-07-23 12:34:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1128 states have (on average 1.9902482269503545) internal successors, (2245), 1947 states have internal predecessors, (2245), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2267 transitions. [2022-07-23 12:34:43,833 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2267 transitions. Word has length 6 [2022-07-23 12:34:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:43,833 INFO L495 AbstractCegarLoop]: Abstraction has 1956 states and 2267 transitions. [2022-07-23 12:34:43,833 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-23 12:34:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2267 transitions. [2022-07-23 12:34:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 12:34:43,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:43,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:34:43,843 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-23 12:34:44,043 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-23 12:34:44,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-23 12:34:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:44,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344911844] [2022-07-23 12:34:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:44,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:44,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:44,046 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-23 12:34:44,048 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-23 12:34:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:44,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:34:44,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:44,220 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-23 12:34:44,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:44,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:44,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344911844] [2022-07-23 12:34:44,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344911844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:44,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:44,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:34:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962323976] [2022-07-23 12:34:44,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:44,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:34:44,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:34:44,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:34:44,223 INFO L87 Difference]: Start difference. First operand 1956 states and 2267 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-23 12:34:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:44,261 INFO L93 Difference]: Finished difference Result 1920 states and 2230 transitions. [2022-07-23 12:34:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:34:44,262 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-23 12:34:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:44,268 INFO L225 Difference]: With dead ends: 1920 [2022-07-23 12:34:44,268 INFO L226 Difference]: Without dead ends: 1920 [2022-07-23 12:34:44,269 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-23 12:34:44,269 INFO L413 NwaCegarLoop]: 1766 mSDtfsCounter, 1736 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 1794 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-23 12:34:44,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 1794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:34:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2022-07-23 12:34:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1914. [2022-07-23 12:34:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1110 states have (on average 1.9837837837837837) internal successors, (2202), 1905 states have internal predecessors, (2202), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2224 transitions. [2022-07-23 12:34:44,310 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2224 transitions. Word has length 11 [2022-07-23 12:34:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:44,311 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2224 transitions. [2022-07-23 12:34:44,311 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-23 12:34:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2224 transitions. [2022-07-23 12:34:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 12:34:44,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:44,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:34:44,324 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-23 12:34:44,522 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-23 12:34:44,522 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-23 12:34:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:44,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157479782] [2022-07-23 12:34:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:44,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:44,525 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-23 12:34:44,525 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-23 12:34:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:44,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:34:44,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:44,694 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-23 12:34:44,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:44,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:44,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157479782] [2022-07-23 12:34:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157479782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:44,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:44,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:34:44,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577014157] [2022-07-23 12:34:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:44,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:34:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:44,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:34:44,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:34:44,696 INFO L87 Difference]: Start difference. First operand 1914 states and 2224 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-23 12:34:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:44,766 INFO L93 Difference]: Finished difference Result 1899 states and 2202 transitions. [2022-07-23 12:34:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:34:44,767 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-23 12:34:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:44,773 INFO L225 Difference]: With dead ends: 1899 [2022-07-23 12:34:44,774 INFO L226 Difference]: Without dead ends: 1899 [2022-07-23 12:34:44,774 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-23 12:34:44,775 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 1707 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 3463 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-23 12:34:44,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 3463 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:34:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-07-23 12:34:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1892. [2022-07-23 12:34:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1102 states have (on average 1.971869328493648) internal successors, (2173), 1883 states have internal predecessors, (2173), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2195 transitions. [2022-07-23 12:34:44,811 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2195 transitions. Word has length 13 [2022-07-23 12:34:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:44,811 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2195 transitions. [2022-07-23 12:34:44,811 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-23 12:34:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2195 transitions. [2022-07-23 12:34:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 12:34:44,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:44,812 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-23 12:34:44,825 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-23 12:34:45,022 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-23 12:34:45,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-23 12:34:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:45,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456239332] [2022-07-23 12:34:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:45,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:45,026 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-23 12:34:45,028 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-23 12:34:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:45,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:34:45,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:45,214 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-23 12:34:45,260 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-23 12:34:45,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:45,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456239332] [2022-07-23 12:34:45,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456239332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:45,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:45,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:34:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354048082] [2022-07-23 12:34:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:45,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:34:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:34:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:34:45,264 INFO L87 Difference]: Start difference. First operand 1892 states and 2195 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-23 12:34:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:49,249 INFO L93 Difference]: Finished difference Result 3106 states and 3455 transitions. [2022-07-23 12:34:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:34:49,250 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-23 12:34:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:49,261 INFO L225 Difference]: With dead ends: 3106 [2022-07-23 12:34:49,261 INFO L226 Difference]: Without dead ends: 3106 [2022-07-23 12:34:49,261 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-23 12:34:49,262 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 3382 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-23 12:34:49,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 2422 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-23 12:34:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-07-23 12:34:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1888. [2022-07-23 12:34:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1102 states have (on average 1.9682395644283122) internal successors, (2169), 1879 states have internal predecessors, (2169), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2191 transitions. [2022-07-23 12:34:49,305 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2191 transitions. Word has length 27 [2022-07-23 12:34:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:49,306 INFO L495 AbstractCegarLoop]: Abstraction has 1888 states and 2191 transitions. [2022-07-23 12:34:49,306 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-23 12:34:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2191 transitions. [2022-07-23 12:34:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 12:34:49,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:49,307 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-23 12:34:49,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 12:34:49,517 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-23 12:34:49,517 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-23 12:34:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:49,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366335029] [2022-07-23 12:34:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:49,520 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-23 12:34:49,520 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-23 12:34:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:49,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:34:49,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:49,698 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-23 12:34:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:34:49,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:49,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366335029] [2022-07-23 12:34:49,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366335029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:49,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:49,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:34:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590016895] [2022-07-23 12:34:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:49,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:34:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:34:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:34:49,829 INFO L87 Difference]: Start difference. First operand 1888 states and 2191 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-23 12:34:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:54,465 INFO L93 Difference]: Finished difference Result 2634 states and 2855 transitions. [2022-07-23 12:34:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:34:54,466 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-23 12:34:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:54,473 INFO L225 Difference]: With dead ends: 2634 [2022-07-23 12:34:54,474 INFO L226 Difference]: Without dead ends: 2634 [2022-07-23 12:34:54,474 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-23 12:34:54,475 INFO L413 NwaCegarLoop]: 1272 mSDtfsCounter, 1687 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-23 12:34:54,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 2885 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-23 12:34:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-07-23 12:34:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1884. [2022-07-23 12:34:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1102 states have (on average 1.9646098003629764) internal successors, (2165), 1875 states have internal predecessors, (2165), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2187 transitions. [2022-07-23 12:34:54,511 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2187 transitions. Word has length 27 [2022-07-23 12:34:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:54,511 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 2187 transitions. [2022-07-23 12:34:54,512 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-23 12:34:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2187 transitions. [2022-07-23 12:34:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 12:34:54,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:54,513 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-23 12:34:54,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-23 12:34:54,722 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-23 12:34:54,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:54,723 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-23 12:34:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:54,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292324594] [2022-07-23 12:34:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:54,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:54,725 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-23 12:34:54,726 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-23 12:34:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:54,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:34:54,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:54,970 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-23 12:34:54,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:54,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:54,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292324594] [2022-07-23 12:34:54,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292324594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:54,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:54,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:34:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055916927] [2022-07-23 12:34:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:54,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:34:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:54,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:34:54,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:34:54,974 INFO L87 Difference]: Start difference. First operand 1884 states and 2187 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-23 12:34:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:55,033 INFO L93 Difference]: Finished difference Result 1884 states and 2183 transitions. [2022-07-23 12:34:55,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:34:55,033 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-23 12:34:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:55,039 INFO L225 Difference]: With dead ends: 1884 [2022-07-23 12:34:55,040 INFO L226 Difference]: Without dead ends: 1884 [2022-07-23 12:34:55,040 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-23 12:34:55,042 INFO L413 NwaCegarLoop]: 1715 mSDtfsCounter, 1683 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3441 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-23 12:34:55,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3441 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:34:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-07-23 12:34:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1878. [2022-07-23 12:34:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1096 states have (on average 1.9662408759124088) internal successors, (2155), 1869 states have internal predecessors, (2155), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2177 transitions. [2022-07-23 12:34:55,079 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2177 transitions. Word has length 42 [2022-07-23 12:34:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:55,081 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 2177 transitions. [2022-07-23 12:34:55,081 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-23 12:34:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2177 transitions. [2022-07-23 12:34:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 12:34:55,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:55,086 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-23 12:34:55,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-23 12:34:55,298 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-23 12:34:55,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-23 12:34:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:55,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176275040] [2022-07-23 12:34:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:55,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:55,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:55,309 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-23 12:34:55,311 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-23 12:34:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:55,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:34:55,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:55,786 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-23 12:34:55,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:55,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:55,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176275040] [2022-07-23 12:34:55,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176275040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:55,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:55,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:34:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144310992] [2022-07-23 12:34:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:55,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:34:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:55,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:34:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:34:55,788 INFO L87 Difference]: Start difference. First operand 1878 states and 2177 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-23 12:34:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:34:56,035 INFO L93 Difference]: Finished difference Result 2297 states and 2613 transitions. [2022-07-23 12:34:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:34:56,036 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-23 12:34:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:34:56,042 INFO L225 Difference]: With dead ends: 2297 [2022-07-23 12:34:56,042 INFO L226 Difference]: Without dead ends: 2297 [2022-07-23 12:34:56,042 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-23 12:34:56,043 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 455 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3382 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:34:56,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3382 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:34:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2022-07-23 12:34:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1924. [2022-07-23 12:34:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1142 states have (on average 1.9273204903677759) internal successors, (2201), 1915 states have internal predecessors, (2201), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:34:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2223 transitions. [2022-07-23 12:34:56,080 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2223 transitions. Word has length 50 [2022-07-23 12:34:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:34:56,081 INFO L495 AbstractCegarLoop]: Abstraction has 1924 states and 2223 transitions. [2022-07-23 12:34:56,081 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-23 12:34:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2223 transitions. [2022-07-23 12:34:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 12:34:56,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:34:56,083 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-23 12:34:56,099 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-23 12:34:56,283 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-23 12:34:56,284 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:34:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:34:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-23 12:34:56,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:34:56,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767169731] [2022-07-23 12:34:56,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:34:56,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:34:56,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:34:56,287 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-23 12:34:56,289 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-23 12:34:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:34:56,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:34:56,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:34:56,631 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-23 12:34:56,637 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-23 12:34:57,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:34:57,066 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-23 12:34:57,085 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:34:57,086 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-23 12:34:57,101 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-23 12:34:57,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:34:57,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:34:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767169731] [2022-07-23 12:34:57,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767169731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:34:57,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:34:57,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:34:57,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637082656] [2022-07-23 12:34:57,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:34:57,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:34:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:34:57,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:34:57,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:34:57,109 INFO L87 Difference]: Start difference. First operand 1924 states and 2223 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-23 12:35:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:00,480 INFO L93 Difference]: Finished difference Result 2111 states and 2394 transitions. [2022-07-23 12:35:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:35:00,480 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-23 12:35:00,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:00,486 INFO L225 Difference]: With dead ends: 2111 [2022-07-23 12:35:00,487 INFO L226 Difference]: Without dead ends: 2111 [2022-07-23 12:35:00,487 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-23 12:35:00,487 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1569 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:00,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1308 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 12:35:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-07-23 12:35:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1674. [2022-07-23 12:35:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 976 states have (on average 1.8442622950819672) internal successors, (1800), 1665 states have internal predecessors, (1800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:35:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 1822 transitions. [2022-07-23 12:35:00,514 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 1822 transitions. Word has length 53 [2022-07-23 12:35:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:00,514 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 1822 transitions. [2022-07-23 12:35:00,515 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-23 12:35:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 1822 transitions. [2022-07-23 12:35:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:35:00,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:00,516 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-23 12:35:00,535 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-23 12:35:00,732 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-23 12:35:00,732 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-23 12:35:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691351792] [2022-07-23 12:35:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:35:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:00,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:00,736 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-23 12:35:00,738 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-23 12:35:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:35:00,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:35:01,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:01,013 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-23 12:35:01,027 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-23 12:35:01,054 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-23 12:35:01,065 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-23 12:35:01,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:35:01,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691351792] [2022-07-23 12:35:01,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691351792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:35:01,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:35:01,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:35:01,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161307861] [2022-07-23 12:35:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:35:01,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:35:01,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:35:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:35:01,069 INFO L87 Difference]: Start difference. First operand 1674 states and 1822 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-23 12:35:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:04,254 INFO L93 Difference]: Finished difference Result 1673 states and 1821 transitions. [2022-07-23 12:35:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:35:04,255 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-23 12:35:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:04,259 INFO L225 Difference]: With dead ends: 1673 [2022-07-23 12:35:04,259 INFO L226 Difference]: Without dead ends: 1673 [2022-07-23 12:35:04,259 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-23 12:35:04,260 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:04,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4160 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 12:35:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-07-23 12:35:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-07-23 12:35:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 976 states have (on average 1.8432377049180328) internal successors, (1799), 1664 states have internal predecessors, (1799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:35:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1821 transitions. [2022-07-23 12:35:04,284 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1821 transitions. Word has length 58 [2022-07-23 12:35:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:04,285 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 1821 transitions. [2022-07-23 12:35:04,285 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-23 12:35:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1821 transitions. [2022-07-23 12:35:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:35:04,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:04,286 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-23 12:35:04,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 12:35:04,498 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-23 12:35:04,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:04,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-23 12:35:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:04,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127735688] [2022-07-23 12:35:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:35:04,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:04,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:04,501 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-23 12:35:04,504 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-23 12:35:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:35:04,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 12:35:04,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:04,804 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-23 12:35:04,826 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-23 12:35:04,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 12:35:04,886 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-23 12:35:04,891 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-23 12:35:04,906 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-23 12:35:04,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:35:04,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:04,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127735688] [2022-07-23 12:35:04,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127735688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:35:04,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:35:04,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:35:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787371114] [2022-07-23 12:35:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:35:04,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:35:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:04,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:35:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:35:04,908 INFO L87 Difference]: Start difference. First operand 1673 states and 1821 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-23 12:35:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:09,113 INFO L93 Difference]: Finished difference Result 1672 states and 1820 transitions. [2022-07-23 12:35:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:35:09,113 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-23 12:35:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:09,117 INFO L225 Difference]: With dead ends: 1672 [2022-07-23 12:35:09,118 INFO L226 Difference]: Without dead ends: 1672 [2022-07-23 12:35:09,118 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-23 12:35:09,119 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 2 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4218 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:09,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4218 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-23 12:35:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-07-23 12:35:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2022-07-23 12:35:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 975 states have (on average 1.8441025641025641) internal successors, (1798), 1663 states have internal predecessors, (1798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-23 12:35:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1820 transitions. [2022-07-23 12:35:09,143 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1820 transitions. Word has length 58 [2022-07-23 12:35:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:09,143 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1820 transitions. [2022-07-23 12:35:09,144 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-23 12:35:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1820 transitions. [2022-07-23 12:35:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 12:35:09,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:09,145 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-23 12:35:09,159 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-23 12:35:09,357 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-23 12:35:09,358 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1810601854, now seen corresponding path program 1 times [2022-07-23 12:35:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:09,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136514703] [2022-07-23 12:35:09,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:35:09,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:09,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:09,361 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-23 12:35:09,363 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-23 12:35:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:35:09,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:35:09,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:09,664 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-23 12:35:09,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:35:09,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136514703] [2022-07-23 12:35:09,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136514703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:35:09,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:35:09,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:35:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30974874] [2022-07-23 12:35:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:35:09,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:35:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:35:09,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:35:09,666 INFO L87 Difference]: Start difference. First operand 1672 states and 1820 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-23 12:35:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:09,735 INFO L93 Difference]: Finished difference Result 1675 states and 1825 transitions. [2022-07-23 12:35:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:35:09,736 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-23 12:35:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:09,741 INFO L225 Difference]: With dead ends: 1675 [2022-07-23 12:35:09,741 INFO L226 Difference]: Without dead ends: 1675 [2022-07-23 12:35:09,741 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-23 12:35:09,742 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 2 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4894 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-23 12:35:09,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4894 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:35:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2022-07-23 12:35:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1675. [2022-07-23 12:35:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 977 states have (on average 1.8433981576253837) internal successors, (1801), 1666 states have internal predecessors, (1801), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:35:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1825 transitions. [2022-07-23 12:35:09,789 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1825 transitions. Word has length 66 [2022-07-23 12:35:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:09,790 INFO L495 AbstractCegarLoop]: Abstraction has 1675 states and 1825 transitions. [2022-07-23 12:35:09,790 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-23 12:35:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1825 transitions. [2022-07-23 12:35:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 12:35:09,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:09,791 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-23 12:35:09,807 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-23 12:35:10,005 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-23 12:35:10,005 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash 279721407, now seen corresponding path program 1 times [2022-07-23 12:35:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90957998] [2022-07-23 12:35:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:35:10,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:10,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:10,009 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-23 12:35:10,012 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-23 12:35:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:35:10,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:35:10,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:10,329 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-23 12:35:10,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:35:10,397 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-23 12:35:10,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:10,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90957998] [2022-07-23 12:35:10,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90957998] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:35:10,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:35:10,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 12:35:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246303744] [2022-07-23 12:35:10,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:35:10,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:35:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:35:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:35:10,401 INFO L87 Difference]: Start difference. First operand 1675 states and 1825 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-23 12:35:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:10,610 INFO L93 Difference]: Finished difference Result 1687 states and 1843 transitions. [2022-07-23 12:35:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:35:10,611 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-23 12:35:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:10,619 INFO L225 Difference]: With dead ends: 1687 [2022-07-23 12:35:10,624 INFO L226 Difference]: Without dead ends: 1687 [2022-07-23 12:35:10,625 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-23 12:35:10,628 INFO L413 NwaCegarLoop]: 1634 mSDtfsCounter, 15 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9771 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:10,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9771 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:35:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-07-23 12:35:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1685. [2022-07-23 12:35:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 986 states have (on average 1.841784989858012) internal successors, (1816), 1675 states have internal predecessors, (1816), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:35:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1840 transitions. [2022-07-23 12:35:10,662 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1840 transitions. Word has length 67 [2022-07-23 12:35:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:10,663 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 1840 transitions. [2022-07-23 12:35:10,663 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-23 12:35:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1840 transitions. [2022-07-23 12:35:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 12:35:10,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:10,664 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-23 12:35:10,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 12:35:10,877 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-23 12:35:10,878 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:10,879 INFO L85 PathProgramCache]: Analyzing trace with hash -431906882, now seen corresponding path program 2 times [2022-07-23 12:35:10,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:10,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130818267] [2022-07-23 12:35:10,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:35:10,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:10,881 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-23 12:35:10,883 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-23 12:35:11,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:35:11,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:35:11,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:35:11,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:11,459 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-23 12:35:11,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:35:11,597 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-23 12:35:11,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130818267] [2022-07-23 12:35:11,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130818267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:35:11,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:35:11,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 12:35:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562060423] [2022-07-23 12:35:11,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:35:11,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 12:35:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 12:35:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 12:35:11,599 INFO L87 Difference]: Start difference. First operand 1685 states and 1840 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-23 12:35:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:12,175 INFO L93 Difference]: Finished difference Result 1706 states and 1872 transitions. [2022-07-23 12:35:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 12:35:12,176 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-23 12:35:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:12,179 INFO L225 Difference]: With dead ends: 1706 [2022-07-23 12:35:12,180 INFO L226 Difference]: Without dead ends: 1702 [2022-07-23 12:35:12,180 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-23 12:35:12,181 INFO L413 NwaCegarLoop]: 1637 mSDtfsCounter, 57 mSDsluCounter, 9790 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 11427 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:12,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 11427 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:35:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-07-23 12:35:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1694. [2022-07-23 12:35:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 995 states have (on average 1.8371859296482411) internal successors, (1828), 1684 states have internal predecessors, (1828), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:35:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 1852 transitions. [2022-07-23 12:35:12,204 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 1852 transitions. Word has length 70 [2022-07-23 12:35:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:12,205 INFO L495 AbstractCegarLoop]: Abstraction has 1694 states and 1852 transitions. [2022-07-23 12:35:12,205 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-23 12:35:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 1852 transitions. [2022-07-23 12:35:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 12:35:12,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:12,206 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-23 12:35:12,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-23 12:35:12,421 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-23 12:35:12,421 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:12,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1909247970, now seen corresponding path program 3 times [2022-07-23 12:35:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255716050] [2022-07-23 12:35:12,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 12:35:12,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:12,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:12,424 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-23 12:35:12,424 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-23 12:35:13,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 12:35:13,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:35:13,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:35:13,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:13,220 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-23 12:35:13,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:35:13,892 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-23 12:35:13,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:13,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255716050] [2022-07-23 12:35:13,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255716050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:35:13,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:35:13,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 12:35:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8117169] [2022-07-23 12:35:13,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:35:13,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 12:35:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 12:35:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 12:35:13,895 INFO L87 Difference]: Start difference. First operand 1694 states and 1852 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-23 12:35:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:16,689 INFO L93 Difference]: Finished difference Result 1736 states and 1928 transitions. [2022-07-23 12:35:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 12:35:16,689 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-23 12:35:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:16,693 INFO L225 Difference]: With dead ends: 1736 [2022-07-23 12:35:16,693 INFO L226 Difference]: Without dead ends: 1730 [2022-07-23 12:35:16,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 12:35:16,695 INFO L413 NwaCegarLoop]: 1641 mSDtfsCounter, 129 mSDsluCounter, 17996 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 19637 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:16,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 19637 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 12:35:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-07-23 12:35:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1712. [2022-07-23 12:35:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1013 states have (on average 1.8272458045409674) internal successors, (1851), 1702 states have internal predecessors, (1851), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:35:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 1875 transitions. [2022-07-23 12:35:16,720 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 1875 transitions. Word has length 76 [2022-07-23 12:35:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:16,721 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 1875 transitions. [2022-07-23 12:35:16,721 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-23 12:35:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 1875 transitions. [2022-07-23 12:35:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 12:35:16,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:16,722 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-23 12:35:16,740 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-23 12:35:16,937 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-23 12:35:16,938 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2142570274, now seen corresponding path program 4 times [2022-07-23 12:35:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217242447] [2022-07-23 12:35:16,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 12:35:16,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:16,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:16,940 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-23 12:35:16,941 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-23 12:35:17,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 12:35:17,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:35:17,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:35:17,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:17,619 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-23 12:35:17,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:35:18,974 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-23 12:35:18,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217242447] [2022-07-23 12:35:18,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217242447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:35:18,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:35:18,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 12:35:18,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049863542] [2022-07-23 12:35:18,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:35:18,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 12:35:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:35:18,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 12:35:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 12:35:18,978 INFO L87 Difference]: Start difference. First operand 1712 states and 1875 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-23 12:35:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:35:29,854 INFO L93 Difference]: Finished difference Result 1792 states and 2008 transitions. [2022-07-23 12:35:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 12:35:29,855 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-23 12:35:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:35:29,858 INFO L225 Difference]: With dead ends: 1792 [2022-07-23 12:35:29,858 INFO L226 Difference]: Without dead ends: 1788 [2022-07-23 12:35:29,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 12:35:29,861 INFO L413 NwaCegarLoop]: 1654 mSDtfsCounter, 413 mSDsluCounter, 37931 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 39585 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:35:29,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 39585 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 12:35:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-07-23 12:35:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1746. [2022-07-23 12:35:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1047 states have (on average 1.8118433619866285) internal successors, (1897), 1736 states have internal predecessors, (1897), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:35:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 1921 transitions. [2022-07-23 12:35:29,889 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 1921 transitions. Word has length 88 [2022-07-23 12:35:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:35:29,890 INFO L495 AbstractCegarLoop]: Abstraction has 1746 states and 1921 transitions. [2022-07-23 12:35:29,890 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-23 12:35:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 1921 transitions. [2022-07-23 12:35:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 12:35:29,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:35:29,891 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-23 12:35:29,907 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-23 12:35:30,106 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-23 12:35:30,107 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:35:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:35:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 286593598, now seen corresponding path program 5 times [2022-07-23 12:35:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:35:30,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530380734] [2022-07-23 12:35:30,108 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:35:30,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:35:30,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:35:30,109 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-23 12:35:30,112 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-23 12:35:31,310 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:35:31,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:35:31,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 12:35:31,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:35:31,356 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-23 12:35:31,455 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:35:31,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 12:35:31,479 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-23 12:35:31,549 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 22 treesize of output 10 [2022-07-23 12:35:31,843 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1608)))) is different from true [2022-07-23 12:35:32,201 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1621 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1621) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:35:32,858 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:35:32,858 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 34 treesize of output 35 [2022-07-23 12:35:32,891 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 31 treesize of output 13 [2022-07-23 12:35:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-07-23 12:35:32,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:35:33,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:35:33,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530380734] [2022-07-23 12:35:33,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530380734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:35:33,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1552591424] [2022-07-23 12:35:33,165 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:35:33,166 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:35:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:35:33,167 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-23 12:35:33,168 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-23 12:37:08,479 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:37:08,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:37:08,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-23 12:37:08,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:37:08,769 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-23 12:37:08,852 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:37:08,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 12:37:08,864 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-23 12:37:08,906 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 22 treesize of output 10 [2022-07-23 12:37:09,386 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2062 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2062) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:37:09,932 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2081 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2081)))) is different from true [2022-07-23 12:37:10,260 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:37:10,261 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 34 treesize of output 35 [2022-07-23 12:37:10,284 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 31 treesize of output 13 [2022-07-23 12:37:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 861 trivial. 87 not checked. [2022-07-23 12:37:10,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:37:10,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1552591424] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:37:10,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:37:10,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2022-07-23 12:37:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465410681] [2022-07-23 12:37:10,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:37:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 12:37:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:37:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 12:37:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=97, Unknown=14, NotChecked=92, Total=240 [2022-07-23 12:37:10,519 INFO L87 Difference]: Start difference. First operand 1746 states and 1921 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 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-23 12:37:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:37:15,624 INFO L93 Difference]: Finished difference Result 2069 states and 2231 transitions. [2022-07-23 12:37:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 12:37:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 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 110 [2022-07-23 12:37:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:37:15,628 INFO L225 Difference]: With dead ends: 2069 [2022-07-23 12:37:15,629 INFO L226 Difference]: Without dead ends: 2065 [2022-07-23 12:37:15,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 125 SyntacticMatches, 88 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=16, NotChecked=108, Total=306 [2022-07-23 12:37:15,629 INFO L413 NwaCegarLoop]: 1056 mSDtfsCounter, 1139 mSDsluCounter, 4752 mSDsCounter, 0 mSdLazyCounter, 3406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 5808 SdHoareTripleChecker+Invalid, 13055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9637 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-23 12:37:15,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 5808 Invalid, 13055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3406 Invalid, 0 Unknown, 9637 Unchecked, 4.9s Time] [2022-07-23 12:37:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2022-07-23 12:37:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 1794. [2022-07-23 12:37:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1095 states have (on average 1.7762557077625571) internal successors, (1945), 1783 states have internal predecessors, (1945), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-23 12:37:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 1969 transitions. [2022-07-23 12:37:15,659 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 1969 transitions. Word has length 110 [2022-07-23 12:37:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:37:15,659 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 1969 transitions. [2022-07-23 12:37:15,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 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-23 12:37:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 1969 transitions. [2022-07-23 12:37:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 12:37:15,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:37:15,661 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-23 12:37:15,685 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-23 12:37:15,914 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-23 12:37:16,079 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-23 12:37:16,080 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 929 more)] === [2022-07-23 12:37:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:37:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 286593599, now seen corresponding path program 1 times [2022-07-23 12:37:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:37:16,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487533704] [2022-07-23 12:37:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:37:16,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:37:16,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:37:16,082 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-23 12:37:16,083 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-23 12:37:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:37:16,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 12:37:16,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:37:16,971 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-23 12:37:17,055 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:37:17,056 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-23 12:37:17,064 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-23 12:37:17,080 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-23 12:37:17,088 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-23 12:37:17,181 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 22 treesize of output 10 [2022-07-23 12:37:17,187 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 9 treesize of output 3 [2022-07-23 12:37:17,277 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:37:17,288 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-23 12:37:17,298 WARN L855 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (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-23 12:37:17,308 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:37:17,368 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-23 12:37:17,377 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:37:17,409 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:37:17,419 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ 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-23 12:37:17,427 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ 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-23 12:37:17,454 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ 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-23 12:37:17,474 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:37:17,505 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-23 12:37:17,513 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534)))) is different from true [2022-07-23 12:37:17,546 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ 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-23 12:37:17,555 WARN L855 $PredicateComparison]: unable to prove that (and (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_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (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-23 12:37:17,564 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:37:17,633 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:37:17,642 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552)))) is different from true [2022-07-23 12:37:17,676 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:37:17,721 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2562) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2563)))) is different from true [2022-07-23 12:37:17,734 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2565 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2565))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2564)))) is different from true [2022-07-23 12:37:17,741 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2567 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2567))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2566 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2566)))) is different from true [2022-07-23 12:37:17,769 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:37:17,779 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2573))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2572) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:37:17,851 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:37:17,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2581))) (exists ((v_ArrVal_2580 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2580)))) is different from true [2022-07-23 12:37:17,867 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582)))) is different from true [2022-07-23 12:37:17,875 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-23 12:37:17,911 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:37:17,912 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-23 12:37:17,918 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-23 12:37:17,953 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 31 treesize of output 13 [2022-07-23 12:37:17,957 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 19 treesize of output 7 [2022-07-23 12:37:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-07-23 12:37:17,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:37:18,772 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (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_2676) |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_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |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-23 12:37:18,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:37:18,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487533704] [2022-07-23 12:37:18,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487533704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:37:18,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793294072] [2022-07-23 12:37:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:37:18,781 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:37:18,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:37:18,784 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-23 12:37:18,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process