./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:39:19,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:39:19,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:39:19,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:39:19,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:39:19,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:39:19,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:39:19,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:39:19,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:39:19,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:39:19,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:39:19,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:39:19,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:39:19,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:39:19,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:39:19,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:39:19,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:39:19,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:39:19,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:39:19,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:39:19,349 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:39:19,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:39:19,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:39:19,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:39:19,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:39:19,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:39:19,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:39:19,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:39:19,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:39:19,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:39:19,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:39:19,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:39:19,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:39:19,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:39:19,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:39:19,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:39:19,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:39:19,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:39:19,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:39:19,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:39:19,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:39:19,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:39:19,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-21 23:39:19,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:39:19,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:39:19,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:39:19,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:39:19,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:39:19,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:39:19,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:39:19,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:39:19,409 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:39:19,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:39:19,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:39:19,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:39:19,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:39:19,410 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:39:19,410 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:39:19,411 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:39:19,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:39:19,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:39:19,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:39:19,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:39:19,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:39:19,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:39:19,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:39:19,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:39:19,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:39:19,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 23:39:19,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 23:39:19,413 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2022-07-21 23:39:19,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:39:19,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:39:19,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:39:19,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:39:19,770 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:39:19,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-21 23:39:19,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9a2b7fc/18a69fcec3184588992a6723b0a6044a/FLAGd7dac2032 [2022-07-21 23:39:20,353 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:39:20,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-21 23:39:20,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9a2b7fc/18a69fcec3184588992a6723b0a6044a/FLAGd7dac2032 [2022-07-21 23:39:20,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9a2b7fc/18a69fcec3184588992a6723b0a6044a [2022-07-21 23:39:20,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:39:20,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:39:20,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:20,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:39:20,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:39:20,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:20" (1/1) ... [2022-07-21 23:39:20,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d71f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:20, skipping insertion in model container [2022-07-21 23:39:20,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:20" (1/1) ... [2022-07-21 23:39:20,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:39:20,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:39:21,363 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/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-21 23:39:21,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:21,427 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-21 23:39:21,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@268aea73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:21, skipping insertion in model container [2022-07-21 23:39:21,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:21,428 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 23:39:21,430 INFO L158 Benchmark]: Toolchain (without parser) took 620.60ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 39.7MB in the end (delta: 3.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 23:39:21,430 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 65.0MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 23:39:21,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.90ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 39.7MB in the end (delta: 2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 23:39:21,432 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.21ms. Allocated memory is still 65.0MB. Free memory was 47.3MB in the beginning and 47.2MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.90ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 39.7MB in the end (delta: 2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: 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/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:39:23,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:39:23,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:39:23,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:39:23,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:39:23,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:39:23,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:39:23,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:39:23,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:39:23,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:39:23,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:39:23,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:39:23,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:39:23,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:39:23,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:39:23,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:39:23,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:39:23,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:39:23,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:39:23,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:39:23,203 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:39:23,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:39:23,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:39:23,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:39:23,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:39:23,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:39:23,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:39:23,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:39:23,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:39:23,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:39:23,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:39:23,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:39:23,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:39:23,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:39:23,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:39:23,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:39:23,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:39:23,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:39:23,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:39:23,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:39:23,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:39:23,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:39:23,224 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-21 23:39:23,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:39:23,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:39:23,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:39:23,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:39:23,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:39:23,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:39:23,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:39:23,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:39:23,263 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:39:23,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:39:23,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:39:23,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:39:23,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:39:23,265 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:39:23,265 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:39:23,266 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:39:23,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:39:23,266 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:39:23,266 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 23:39:23,266 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 23:39:23,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:39:23,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:39:23,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:39:23,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:39:23,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:39:23,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:39:23,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:39:23,268 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 23:39:23,268 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 23:39:23,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 23:39:23,269 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2022-07-21 23:39:23,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:39:23,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:39:23,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:39:23,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:39:23,599 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:39:23,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-21 23:39:23,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556dbe9bd/94a30610c3964718846dcebebb32d5f8/FLAG1d008b826 [2022-07-21 23:39:24,211 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:39:24,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-21 23:39:24,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556dbe9bd/94a30610c3964718846dcebebb32d5f8/FLAG1d008b826 [2022-07-21 23:39:24,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556dbe9bd/94a30610c3964718846dcebebb32d5f8 [2022-07-21 23:39:24,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:39:24,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:39:24,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:24,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:39:24,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:39:24,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:24" (1/1) ... [2022-07-21 23:39:24,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61729500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:24, skipping insertion in model container [2022-07-21 23:39:24,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:24" (1/1) ... [2022-07-21 23:39:24,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:39:24,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:39:25,310 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/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-21 23:39:25,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:25,395 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 23:39:25,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:39:25,450 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/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-21 23:39:25,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:25,502 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 23:39:25,545 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/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-21 23:39:25,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:25,674 INFO L208 MainTranslator]: Completed translation [2022-07-21 23:39:25,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25 WrapperNode [2022-07-21 23:39:25,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:25,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 23:39:25,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 23:39:25,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 23:39:25,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,758 INFO L137 Inliner]: procedures = 352, calls = 112, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 383 [2022-07-21 23:39:25,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 23:39:25,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 23:39:25,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 23:39:25,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 23:39:25,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 23:39:25,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 23:39:25,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 23:39:25,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 23:39:25,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (1/1) ... [2022-07-21 23:39:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:39:25,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 23:39:25,869 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-21 23:39:25,897 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-21 23:39:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 23:39:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 23:39:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 23:39:25,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-07-21 23:39:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 23:39:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 23:39:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 23:39:25,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 23:39:26,201 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 23:39:26,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 23:39:27,199 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 23:39:27,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 23:39:27,209 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-21 23:39:27,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:39:27 BoogieIcfgContainer [2022-07-21 23:39:27,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 23:39:27,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 23:39:27,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 23:39:27,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 23:39:27,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:39:24" (1/3) ... [2022-07-21 23:39:27,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578b79db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:39:27, skipping insertion in model container [2022-07-21 23:39:27,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:25" (2/3) ... [2022-07-21 23:39:27,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578b79db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:39:27, skipping insertion in model container [2022-07-21 23:39:27,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:39:27" (3/3) ... [2022-07-21 23:39:27,228 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-1.i [2022-07-21 23:39:27,240 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 23:39:27,241 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-07-21 23:39:27,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 23:39:27,298 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@74c9665d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23839741 [2022-07-21 23:39:27,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-07-21 23:39:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 23:39:27,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:27,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 23:39:27,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-21 23:39:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:27,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662903648] [2022-07-21 23:39:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:27,329 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-21 23:39:27,330 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-21 23:39:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:27,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:39:27,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:27,523 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-21 23:39:27,535 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-21 23:39:27,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:27,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:27,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662903648] [2022-07-21 23:39:27,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662903648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:27,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:27,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793188654] [2022-07-21 23:39:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:27,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:27,600 INFO L87 Difference]: Start difference. First operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 23:39:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:28,072 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2022-07-21 23:39:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-21 23:39:28,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:28,083 INFO L225 Difference]: With dead ends: 251 [2022-07-21 23:39:28,084 INFO L226 Difference]: Without dead ends: 249 [2022-07-21 23:39:28,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 23:39:28,088 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 239 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:28,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 207 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-21 23:39:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2022-07-21 23:39:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2022-07-21 23:39:28,134 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 3 [2022-07-21 23:39:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:28,135 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2022-07-21 23:39:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 23:39:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2022-07-21 23:39:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 23:39:28,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:28,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 23:39:28,151 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-21 23:39:28,347 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-21 23:39:28,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-21 23:39:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182483345] [2022-07-21 23:39:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:28,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:28,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:28,352 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-21 23:39:28,354 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-21 23:39:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:28,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:39:28,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:28,481 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-21 23:39:28,491 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-21 23:39:28,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:28,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:28,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182483345] [2022-07-21 23:39:28,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182483345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:28,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:28,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060458278] [2022-07-21 23:39:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:28,494 INFO L87 Difference]: Start difference. First operand 233 states and 266 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 23:39:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:29,147 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2022-07-21 23:39:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-21 23:39:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:29,150 INFO L225 Difference]: With dead ends: 232 [2022-07-21 23:39:29,151 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 23:39:29,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 23:39:29,152 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:29,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 23:39:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 23:39:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-21 23:39:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 265 transitions. [2022-07-21 23:39:29,172 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 265 transitions. Word has length 3 [2022-07-21 23:39:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:29,173 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 265 transitions. [2022-07-21 23:39:29,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-21 23:39:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2022-07-21 23:39:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 23:39:29,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:29,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 23:39:29,188 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-21 23:39:29,386 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-21 23:39:29,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-07-21 23:39:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:29,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111666488] [2022-07-21 23:39:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:29,389 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-21 23:39:29,391 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-21 23:39:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:29,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:29,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:29,522 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-21 23:39:29,587 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-21 23:39:29,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:29,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:29,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111666488] [2022-07-21 23:39:29,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111666488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:29,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:29,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:39:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64218178] [2022-07-21 23:39:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:29,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:39:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:39:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:29,590 INFO L87 Difference]: Start difference. First operand 232 states and 265 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-21 23:39:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:30,188 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-07-21 23:39:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:39:30,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-21 23:39:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:30,190 INFO L225 Difference]: With dead ends: 236 [2022-07-21 23:39:30,190 INFO L226 Difference]: Without dead ends: 236 [2022-07-21 23:39:30,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-21 23:39:30,191 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 13 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:30,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 431 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 23:39:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-21 23:39:30,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2022-07-21 23:39:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 144 states have (on average 1.8263888888888888) internal successors, (263), 230 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2022-07-21 23:39:30,210 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 6 [2022-07-21 23:39:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:30,210 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2022-07-21 23:39:30,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-21 23:39:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-07-21 23:39:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 23:39:30,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:30,214 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:30,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:30,414 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-21 23:39:30,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:30,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-07-21 23:39:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:30,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800883366] [2022-07-21 23:39:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:30,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:30,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:30,417 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-21 23:39:30,418 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-21 23:39:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:30,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 23:39:30,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:30,554 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-21 23:39:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:30,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:31,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800883366] [2022-07-21 23:39:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800883366] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:39:31,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:39:31,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-21 23:39:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655834243] [2022-07-21 23:39:31,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:39:31,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 23:39:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 23:39:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 23:39:31,569 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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-21 23:39:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:34,839 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2022-07-21 23:39:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 23:39:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 10 [2022-07-21 23:39:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:34,845 INFO L225 Difference]: With dead ends: 240 [2022-07-21 23:39:34,845 INFO L226 Difference]: Without dead ends: 240 [2022-07-21 23:39:34,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:39:34,846 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 19 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:34,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1120 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-21 23:39:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-21 23:39:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-07-21 23:39:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2022-07-21 23:39:34,863 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 10 [2022-07-21 23:39:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:34,863 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2022-07-21 23:39:34,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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-21 23:39:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-07-21 23:39:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 23:39:34,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:34,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:34,874 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-21 23:39:35,067 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-21 23:39:35,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash -955562967, now seen corresponding path program 1 times [2022-07-21 23:39:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:35,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417486484] [2022-07-21 23:39:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:35,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:35,071 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-21 23:39:35,073 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-21 23:39:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:35,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:35,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:35,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:35,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:35,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417486484] [2022-07-21 23:39:35,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417486484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:39:35,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:39:35,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 23:39:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018982137] [2022-07-21 23:39:35,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:39:35,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 23:39:35,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:35,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 23:39:35,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:39:35,344 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:39:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:35,547 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2022-07-21 23:39:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 23:39:35,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-21 23:39:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:35,549 INFO L225 Difference]: With dead ends: 260 [2022-07-21 23:39:35,549 INFO L226 Difference]: Without dead ends: 260 [2022-07-21 23:39:35,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-21 23:39:35,550 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 24 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:35,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1564 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 23:39:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-21 23:39:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-07-21 23:39:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 293 transitions. [2022-07-21 23:39:35,558 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 293 transitions. Word has length 25 [2022-07-21 23:39:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:35,559 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 293 transitions. [2022-07-21 23:39:35,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:39:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2022-07-21 23:39:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 23:39:35,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:35,560 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:35,575 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-21 23:39:35,773 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-21 23:39:35,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash -167681350, now seen corresponding path program 2 times [2022-07-21 23:39:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:35,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657524691] [2022-07-21 23:39:35,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 23:39:35,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:35,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:35,776 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-21 23:39:35,777 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-21 23:39:35,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 23:39:35,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:39:35,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:35,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:35,946 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 23:39:35,947 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-21 23:39:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 23:39:35,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:35,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:35,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657524691] [2022-07-21 23:39:35,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657524691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:35,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:35,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664685935] [2022-07-21 23:39:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:35,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:35,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:35,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:35,982 INFO L87 Difference]: Start difference. First operand 260 states and 293 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:36,369 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-07-21 23:39:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:36,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-21 23:39:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:36,371 INFO L225 Difference]: With dead ends: 271 [2022-07-21 23:39:36,371 INFO L226 Difference]: Without dead ends: 271 [2022-07-21 23:39:36,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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-21 23:39:36,372 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 224 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:36,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 210 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-21 23:39:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2022-07-21 23:39:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2022-07-21 23:39:36,378 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 45 [2022-07-21 23:39:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:36,380 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2022-07-21 23:39:36,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2022-07-21 23:39:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 23:39:36,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:36,382 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:36,394 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-21 23:39:36,593 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-21 23:39:36,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -167681349, now seen corresponding path program 1 times [2022-07-21 23:39:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:36,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26306473] [2022-07-21 23:39:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:36,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:36,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:36,596 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-21 23:39:36,597 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-21 23:39:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:36,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 23:39:36,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:36,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:37,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26306473] [2022-07-21 23:39:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26306473] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:39:37,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:39:37,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-21 23:39:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908285523] [2022-07-21 23:39:37,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:39:37,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 23:39:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 23:39:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-21 23:39:37,174 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:39:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:37,548 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2022-07-21 23:39:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 23:39:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-21 23:39:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:37,550 INFO L225 Difference]: With dead ends: 263 [2022-07-21 23:39:37,550 INFO L226 Difference]: Without dead ends: 263 [2022-07-21 23:39:37,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-21 23:39:37,552 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 33 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:37,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2862 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-21 23:39:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-21 23:39:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2022-07-21 23:39:37,558 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 45 [2022-07-21 23:39:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:37,558 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2022-07-21 23:39:37,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 23:39:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-07-21 23:39:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 23:39:37,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:37,560 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:37,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 23:39:37,773 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-21 23:39:37,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1953485173, now seen corresponding path program 2 times [2022-07-21 23:39:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:37,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352011020] [2022-07-21 23:39:37,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 23:39:37,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:37,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:37,776 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-21 23:39:37,777 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-21 23:39:37,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 23:39:37,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:39:37,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 23:39:37,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:37,993 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 23:39:37,994 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:38,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:38,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:38,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352011020] [2022-07-21 23:39:38,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352011020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:38,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:38,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 23:39:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105817574] [2022-07-21 23:39:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:38,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 23:39:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 23:39:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 23:39:38,086 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:39,376 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2022-07-21 23:39:39,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 23:39:39,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-07-21 23:39:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:39,379 INFO L225 Difference]: With dead ends: 445 [2022-07-21 23:39:39,380 INFO L226 Difference]: Without dead ends: 445 [2022-07-21 23:39:39,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:39:39,380 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 667 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:39,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 721 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 23:39:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-21 23:39:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 369. [2022-07-21 23:39:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 23:39:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 497 transitions. [2022-07-21 23:39:39,393 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 497 transitions. Word has length 53 [2022-07-21 23:39:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:39,393 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 497 transitions. [2022-07-21 23:39:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 497 transitions. [2022-07-21 23:39:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 23:39:39,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:39,395 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:39,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:39,599 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-21 23:39:39,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash -530101490, now seen corresponding path program 1 times [2022-07-21 23:39:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557443804] [2022-07-21 23:39:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:39,602 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-21 23:39:39,603 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-21 23:39:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:39,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 23:39:40,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:40,058 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 23:39:40,059 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:40,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 23:39:40,426 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 23:39:40,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2022-07-21 23:39:40,445 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:39:40,445 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-21 23:39:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:40,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:40,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:40,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557443804] [2022-07-21 23:39:40,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557443804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:40,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:40,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 23:39:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464726054] [2022-07-21 23:39:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:40,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 23:39:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:40,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 23:39:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 23:39:40,558 INFO L87 Difference]: Start difference. First operand 369 states and 497 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:40,664 INFO L93 Difference]: Finished difference Result 370 states and 498 transitions. [2022-07-21 23:39:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:39:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-07-21 23:39:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:40,666 INFO L225 Difference]: With dead ends: 370 [2022-07-21 23:39:40,666 INFO L226 Difference]: Without dead ends: 370 [2022-07-21 23:39:40,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-21 23:39:40,667 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 5 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:40,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1278 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 220 Unchecked, 0.0s Time] [2022-07-21 23:39:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-21 23:39:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-07-21 23:39:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 23:39:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 498 transitions. [2022-07-21 23:39:40,676 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 498 transitions. Word has length 56 [2022-07-21 23:39:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:40,676 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 498 transitions. [2022-07-21 23:39:40,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2022-07-21 23:39:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 23:39:40,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:40,677 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:40,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:40,894 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-21 23:39:40,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 746722395, now seen corresponding path program 1 times [2022-07-21 23:39:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60944174] [2022-07-21 23:39:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:40,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:40,898 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-21 23:39:40,900 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-21 23:39:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:41,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:39:41,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:41,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:41,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60944174] [2022-07-21 23:39:41,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60944174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:41,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:41,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:39:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407808034] [2022-07-21 23:39:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:41,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:39:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:39:41,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:41,135 INFO L87 Difference]: Start difference. First operand 370 states and 498 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:41,609 INFO L93 Difference]: Finished difference Result 387 states and 518 transitions. [2022-07-21 23:39:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:39:41,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-07-21 23:39:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:41,611 INFO L225 Difference]: With dead ends: 387 [2022-07-21 23:39:41,611 INFO L226 Difference]: Without dead ends: 387 [2022-07-21 23:39:41,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-21 23:39:41,612 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 394 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:41,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 244 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 23:39:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-07-21 23:39:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 363. [2022-07-21 23:39:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 23:39:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 484 transitions. [2022-07-21 23:39:41,620 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 484 transitions. Word has length 57 [2022-07-21 23:39:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:41,621 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 484 transitions. [2022-07-21 23:39:41,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 484 transitions. [2022-07-21 23:39:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 23:39:41,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:41,622 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:41,635 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-21 23:39:41,831 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-21 23:39:41,831 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 746722396, now seen corresponding path program 1 times [2022-07-21 23:39:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:41,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717816306] [2022-07-21 23:39:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:41,834 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-21 23:39:41,835 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-21 23:39:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:42,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:42,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:42,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:42,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:42,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717816306] [2022-07-21 23:39:42,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717816306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:42,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:42,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 23:39:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348253851] [2022-07-21 23:39:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:42,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 23:39:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 23:39:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 23:39:42,152 INFO L87 Difference]: Start difference. First operand 363 states and 484 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:42,450 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-07-21 23:39:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 23:39:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-07-21 23:39:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:42,456 INFO L225 Difference]: With dead ends: 279 [2022-07-21 23:39:42,456 INFO L226 Difference]: Without dead ends: 279 [2022-07-21 23:39:42,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:39:42,457 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 258 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:42,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 922 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 23:39:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-21 23:39:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2022-07-21 23:39:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2022-07-21 23:39:42,463 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 57 [2022-07-21 23:39:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:42,463 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2022-07-21 23:39:42,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2022-07-21 23:39:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 23:39:42,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:42,464 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:42,479 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-21 23:39:42,675 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-21 23:39:42,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1673575759, now seen corresponding path program 1 times [2022-07-21 23:39:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:42,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532004440] [2022-07-21 23:39:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:42,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:42,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:42,678 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-21 23:39:42,680 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-21 23:39:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:42,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:39:42,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:42,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:42,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:42,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532004440] [2022-07-21 23:39:42,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532004440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:42,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:42,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:39:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701008038] [2022-07-21 23:39:42,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:42,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 23:39:42,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:42,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 23:39:42,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:39:42,977 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 23:39:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:43,787 INFO L93 Difference]: Finished difference Result 275 states and 309 transitions. [2022-07-21 23:39:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 23:39:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 58 [2022-07-21 23:39:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:43,790 INFO L225 Difference]: With dead ends: 275 [2022-07-21 23:39:43,790 INFO L226 Difference]: Without dead ends: 275 [2022-07-21 23:39:43,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:39:43,790 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 254 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:43,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 624 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 23:39:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-21 23:39:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-07-21 23:39:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.5751295336787565) internal successors, (304), 264 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2022-07-21 23:39:43,795 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 58 [2022-07-21 23:39:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:43,796 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2022-07-21 23:39:43,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 23:39:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2022-07-21 23:39:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 23:39:43,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:43,799 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:43,816 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-21 23:39:44,009 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-21 23:39:44,010 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash 341240963, now seen corresponding path program 1 times [2022-07-21 23:39:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771286969] [2022-07-21 23:39:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:44,012 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-21 23:39:44,013 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-21 23:39:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:44,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 23:39:44,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:44,448 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-21 23:39:44,448 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 23:39:44,469 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 23:39:44,469 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-21 23:39:44,676 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 23:39:44,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-21 23:39:44,723 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:39:44,723 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-21 23:39:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:44,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:44,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:44,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771286969] [2022-07-21 23:39:44,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771286969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:44,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:44,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 23:39:44,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078785010] [2022-07-21 23:39:44,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:44,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 23:39:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 23:39:44,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 23:39:44,939 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 23:39:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:45,063 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2022-07-21 23:39:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 23:39:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2022-07-21 23:39:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:45,065 INFO L225 Difference]: With dead ends: 268 [2022-07-21 23:39:45,065 INFO L226 Difference]: Without dead ends: 268 [2022-07-21 23:39:45,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 23:39:45,066 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:45,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1352 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 329 Unchecked, 0.0s Time] [2022-07-21 23:39:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-21 23:39:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-21 23:39:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.5699481865284974) internal successors, (303), 264 states have internal predecessors, (303), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 307 transitions. [2022-07-21 23:39:45,071 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 307 transitions. Word has length 59 [2022-07-21 23:39:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:45,071 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 307 transitions. [2022-07-21 23:39:45,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 23:39:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 307 transitions. [2022-07-21 23:39:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 23:39:45,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:45,072 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:45,093 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-21 23:39:45,290 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-21 23:39:45,290 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash 341240962, now seen corresponding path program 1 times [2022-07-21 23:39:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724035778] [2022-07-21 23:39:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:45,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:45,292 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-21 23:39:45,293 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-21 23:39:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:45,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 23:39:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:45,742 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 23:39:45,743 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-21 23:39:45,770 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:39:45,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2022-07-21 23:39:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:45,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:45,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724035778] [2022-07-21 23:39:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724035778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:45,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:39:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627204755] [2022-07-21 23:39:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:45,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:39:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:39:45,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:45,793 INFO L87 Difference]: Start difference. First operand 268 states and 307 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-21 23:39:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:46,132 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2022-07-21 23:39:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:39:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 59 [2022-07-21 23:39:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:46,141 INFO L225 Difference]: With dead ends: 275 [2022-07-21 23:39:46,141 INFO L226 Difference]: Without dead ends: 275 [2022-07-21 23:39:46,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-21 23:39:46,142 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 210 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:46,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 354 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 23:39:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-21 23:39:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2022-07-21 23:39:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 198 states have (on average 1.5656565656565657) internal successors, (310), 268 states have internal predecessors, (310), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 314 transitions. [2022-07-21 23:39:46,147 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 314 transitions. Word has length 59 [2022-07-21 23:39:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:46,147 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 314 transitions. [2022-07-21 23:39:46,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-21 23:39:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 314 transitions. [2022-07-21 23:39:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 23:39:46,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:46,149 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:46,163 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-21 23:39:46,354 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-21 23:39:46,354 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash -278071788, now seen corresponding path program 1 times [2022-07-21 23:39:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:46,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378379856] [2022-07-21 23:39:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:46,357 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-21 23:39:46,358 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-21 23:39:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:46,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 23:39:46,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:46,809 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-21 23:39:46,832 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 16 treesize of output 12 [2022-07-21 23:39:46,926 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-21 23:39:46,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-07-21 23:39:46,994 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 26 treesize of output 12 [2022-07-21 23:39:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:47,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:47,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:47,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378379856] [2022-07-21 23:39:47,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378379856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:47,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:47,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 23:39:47,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970371438] [2022-07-21 23:39:47,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:47,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 23:39:47,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 23:39:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 23:39:47,009 INFO L87 Difference]: Start difference. First operand 272 states and 314 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:48,002 INFO L93 Difference]: Finished difference Result 270 states and 310 transitions. [2022-07-21 23:39:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:39:48,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-07-21 23:39:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:48,004 INFO L225 Difference]: With dead ends: 270 [2022-07-21 23:39:48,004 INFO L226 Difference]: Without dead ends: 270 [2022-07-21 23:39:48,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-21 23:39:48,005 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 236 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:48,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1002 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 23:39:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-21 23:39:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-07-21 23:39:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 198 states have (on average 1.5454545454545454) internal successors, (306), 266 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 310 transitions. [2022-07-21 23:39:48,010 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 310 transitions. Word has length 62 [2022-07-21 23:39:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:48,010 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 310 transitions. [2022-07-21 23:39:48,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 310 transitions. [2022-07-21 23:39:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 23:39:48,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:48,011 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:48,033 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-21 23:39:48,211 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-21 23:39:48,211 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash -278071787, now seen corresponding path program 1 times [2022-07-21 23:39:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101264441] [2022-07-21 23:39:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:48,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:48,214 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-21 23:39:48,215 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-21 23:39:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:48,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 23:39:48,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:48,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:39:48,641 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-21 23:39:48,663 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 16 treesize of output 12 [2022-07-21 23:39:48,677 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 16 treesize of output 12 [2022-07-21 23:39:48,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-21 23:39:48,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:48,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-21 23:39:48,814 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 27 treesize of output 9 [2022-07-21 23:39:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:48,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:48,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:48,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101264441] [2022-07-21 23:39:48,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101264441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:48,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:48,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 23:39:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061399239] [2022-07-21 23:39:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:48,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 23:39:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:48,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 23:39:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:39:48,837 INFO L87 Difference]: Start difference. First operand 270 states and 310 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:50,132 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2022-07-21 23:39:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 23:39:50,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-07-21 23:39:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:50,134 INFO L225 Difference]: With dead ends: 269 [2022-07-21 23:39:50,134 INFO L226 Difference]: Without dead ends: 269 [2022-07-21 23:39:50,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:39:50,135 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 233 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:50,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 836 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 23:39:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-21 23:39:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-21 23:39:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 198 states have (on average 1.5353535353535352) internal successors, (304), 265 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 308 transitions. [2022-07-21 23:39:50,140 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 308 transitions. Word has length 62 [2022-07-21 23:39:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:50,140 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 308 transitions. [2022-07-21 23:39:50,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2022-07-21 23:39:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 23:39:50,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:50,141 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-21 23:39:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:50,359 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-21 23:39:50,359 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash -450354753, now seen corresponding path program 1 times [2022-07-21 23:39:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:50,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977643165] [2022-07-21 23:39:50,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:50,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:50,361 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-21 23:39:50,362 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-21 23:39:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:50,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 23:39:50,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:50,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:39:50,864 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:39:50,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 23:39:50,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:39:50,953 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 34 treesize of output 34 [2022-07-21 23:39:51,054 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:39:51,055 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 43 treesize of output 44 [2022-07-21 23:39:51,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:39:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:51,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:51,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:51,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977643165] [2022-07-21 23:39:51,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977643165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:51,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:51,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 23:39:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206118275] [2022-07-21 23:39:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:51,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 23:39:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:51,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 23:39:51,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 23:39:51,187 INFO L87 Difference]: Start difference. First operand 269 states and 308 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-21 23:39:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:52,191 INFO L93 Difference]: Finished difference Result 290 states and 330 transitions. [2022-07-21 23:39:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:39:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-21 23:39:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:52,193 INFO L225 Difference]: With dead ends: 290 [2022-07-21 23:39:52,193 INFO L226 Difference]: Without dead ends: 290 [2022-07-21 23:39:52,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-21 23:39:52,194 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 457 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:52,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 668 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 273 Invalid, 0 Unknown, 91 Unchecked, 0.8s Time] [2022-07-21 23:39:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-21 23:39:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2022-07-21 23:39:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.541062801932367) internal successors, (319), 274 states have internal predecessors, (319), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2022-07-21 23:39:52,203 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 66 [2022-07-21 23:39:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:52,203 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2022-07-21 23:39:52,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-21 23:39:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2022-07-21 23:39:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 23:39:52,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:52,204 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-21 23:39:52,222 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-21 23:39:52,415 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-21 23:39:52,416 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -450354752, now seen corresponding path program 1 times [2022-07-21 23:39:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:52,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868951334] [2022-07-21 23:39:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:52,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:52,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:52,418 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-21 23:39:52,420 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-21 23:39:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:52,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 23:39:52,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:52,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:39:52,969 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-21 23:39:52,981 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:39:52,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:39:53,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:39:53,024 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 16 treesize of output 12 [2022-07-21 23:39:53,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 23:39:53,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:53,237 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:39:53,237 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 58 treesize of output 57 [2022-07-21 23:39:53,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 23:39:53,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:39:53,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-21 23:39:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:53,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:53,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:53,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868951334] [2022-07-21 23:39:53,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868951334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:53,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:53,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 23:39:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6002574] [2022-07-21 23:39:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:53,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 23:39:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 23:39:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:39:53,392 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-21 23:39:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:55,019 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2022-07-21 23:39:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 23:39:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-21 23:39:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:55,020 INFO L225 Difference]: With dead ends: 290 [2022-07-21 23:39:55,021 INFO L226 Difference]: Without dead ends: 290 [2022-07-21 23:39:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-21 23:39:55,021 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 476 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:55,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 694 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 23:39:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-21 23:39:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2022-07-21 23:39:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 274 states have internal predecessors, (315), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 319 transitions. [2022-07-21 23:39:55,030 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 319 transitions. Word has length 66 [2022-07-21 23:39:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:55,030 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 319 transitions. [2022-07-21 23:39:55,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-21 23:39:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 319 transitions. [2022-07-21 23:39:55,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 23:39:55,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:55,031 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 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-21 23:39:55,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-21 23:39:55,235 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-21 23:39:55,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:39:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1408765628, now seen corresponding path program 1 times [2022-07-21 23:39:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:55,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425500769] [2022-07-21 23:39:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:55,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:55,238 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-21 23:39:55,239 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-21 23:39:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:55,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 23:39:55,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:55,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:39:55,861 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:39:55,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 23:39:55,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:39:55,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 23:39:56,063 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:39:56,063 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 43 treesize of output 44 [2022-07-21 23:39:56,152 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:39:56,152 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 43 treesize of output 44 [2022-07-21 23:39:56,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:39:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-21 23:39:56,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:56,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1318) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-21 23:39:56,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1317))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-21 23:39:56,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1317))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-21 23:39:56,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1316))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1317)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-21 23:39:56,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 23:39:56,615 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2022-07-21 23:39:56,621 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 4375 treesize of output 3232 [2022-07-21 23:39:56,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3228 treesize of output 2682 [2022-07-21 23:39:56,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2682 treesize of output 2626 [2022-07-21 23:39:56,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2626 treesize of output 2094 [2022-07-21 23:40:25,616 INFO L356 Elim1Store]: treesize reduction -11, result has 113.6 percent of original size [2022-07-21 23:40:25,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 231 [2022-07-21 23:40:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2022-07-21 23:40:26,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:40:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425500769] [2022-07-21 23:40:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425500769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:40:26,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:40:26,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-21 23:40:26,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285671088] [2022-07-21 23:40:26,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:40:26,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 23:40:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:40:26,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 23:40:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2022-07-21 23:40:26,270 INFO L87 Difference]: Start difference. First operand 278 states and 319 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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-21 23:40:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:40:28,162 INFO L93 Difference]: Finished difference Result 446 states and 515 transitions. [2022-07-21 23:40:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:40:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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 71 [2022-07-21 23:40:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:40:28,165 INFO L225 Difference]: With dead ends: 446 [2022-07-21 23:40:28,165 INFO L226 Difference]: Without dead ends: 446 [2022-07-21 23:40:28,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=228, Unknown=8, NotChecked=140, Total=462 [2022-07-21 23:40:28,166 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 659 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2134 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:40:28,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2056 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 2134 Unchecked, 1.3s Time] [2022-07-21 23:40:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-07-21 23:40:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 296. [2022-07-21 23:40:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 225 states have (on average 1.5155555555555555) internal successors, (341), 292 states have internal predecessors, (341), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:40:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 345 transitions. [2022-07-21 23:40:28,174 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 345 transitions. Word has length 71 [2022-07-21 23:40:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:40:28,175 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 345 transitions. [2022-07-21 23:40:28,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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-21 23:40:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 345 transitions. [2022-07-21 23:40:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 23:40:28,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:40:28,176 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 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-21 23:40:28,193 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-21 23:40:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:40:28,388 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-21 23:40:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:40:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1408765627, now seen corresponding path program 1 times [2022-07-21 23:40:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:40:28,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843637668] [2022-07-21 23:40:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:40:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:40:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:40:28,390 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:40:28,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 23:40:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:40:29,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 23:40:29,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:40:29,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:40:29,161 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-21 23:40:29,178 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:40:29,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:40:29,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:29,231 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 16 treesize of output 12 [2022-07-21 23:40:29,311 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 34 treesize of output 34 [2022-07-21 23:40:29,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:40:29,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:29,441 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 58 treesize of output 57 [2022-07-21 23:40:29,447 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 28 treesize of output 30 [2022-07-21 23:40:29,616 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:29,616 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 58 treesize of output 57 [2022-07-21 23:40:29,623 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 28 treesize of output 30 [2022-07-21 23:40:29,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:40:29,741 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 25 treesize of output 7 [2022-07-21 23:40:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-21 23:40:29,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:40:30,813 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2022-07-21 23:40:30,930 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-21 23:40:31,068 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-21 23:40:31,154 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1435)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1434) .cse0 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1434) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse4 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64)))))) is different from false [2022-07-21 23:40:31,518 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1435))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1434) .cse1 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1434) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1436)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-21 23:40:31,670 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1433 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1432 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1432)) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1435))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1433) .cse0 v_ArrVal_1434) .cse1 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1433 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1432 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse6 (let ((.cse9 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1432))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1433) .cse7 v_ArrVal_1434) (select (select (store .cse8 .cse7 v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_1436))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9)))) (bvule (bvadd .cse5 .cse6) (bvadd .cse5 (_ bv1 64) .cse6))))) is different from false [2022-07-21 23:40:31,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 23:40:31,761 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2022-07-21 23:40:31,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 23:40:31,784 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2022-07-21 23:40:31,799 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 81375 treesize of output 68388 [2022-07-21 23:40:33,106 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 1245093 treesize of output 1204764 [2022-07-21 23:40:37,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1204760 treesize of output 1084696 [2022-07-21 23:40:39,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1084696 treesize of output 964632 [2022-07-21 23:40:41,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 964632 treesize of output 907288 [2022-07-21 23:40:42,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 907288 treesize of output 771061 [2022-07-21 23:40:44,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 771061 treesize of output 739701 [2022-07-21 23:40:46,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 739701 treesize of output 660832 [2022-07-21 23:41:07,951 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 959 DAG size of output: 959 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 23:42:15,878 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 714 DAG size of output: 714 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 23:42:22,562 WARN L233 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 714 DAG size of output: 714 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)