./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:51:00,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:51:00,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:51:00,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:51:00,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:51:00,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:51:00,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:51:00,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:51:00,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:51:00,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:51:00,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:51:00,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:51:00,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:51:00,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:51:00,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:51:00,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:51:00,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:51:00,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:51:00,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:51:00,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:51:00,640 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:51:00,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:51:00,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:51:00,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:51:00,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:51:00,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:51:00,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:51:00,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:51:00,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:51:00,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:51:00,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:51:00,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:51:00,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:51:00,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:51:00,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:51:00,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:51:00,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:51:00,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:51:00,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:51:00,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:51:00,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:51:00,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:51:00,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 12:51:00,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:51:00,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:51:00,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:51:00,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:51:00,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:51:00,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:51:00,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:51:00,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:51:00,689 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:51:00,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:51:00,691 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:51:00,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:51:00,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:51:00,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:51:00,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:51:00,692 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:51:00,692 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:51:00,692 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:51:00,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:51:00,694 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:51:00,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:51:00,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:51:00,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:51:00,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:51:00,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:51:00,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:51:00,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:51:00,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:51:00,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 12:51:00,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 12:51:00,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 [2022-07-14 12:51:00,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:51:00,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:51:00,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:51:00,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:51:00,971 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:51:00,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2022-07-14 12:51:01,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc9375db/25a649a3a93f4a50ac61de1bfb3c1b3b/FLAGfc4642939 [2022-07-14 12:51:01,523 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:51:01,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2022-07-14 12:51:01,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc9375db/25a649a3a93f4a50ac61de1bfb3c1b3b/FLAGfc4642939 [2022-07-14 12:51:02,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc9375db/25a649a3a93f4a50ac61de1bfb3c1b3b [2022-07-14 12:51:02,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:51:02,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:51:02,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:02,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:51:02,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:51:02,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:02" (1/1) ... [2022-07-14 12:51:02,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a2e115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:02, skipping insertion in model container [2022-07-14 12:51:02,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:02" (1/1) ... [2022-07-14 12:51:02,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:51:02,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:51:02,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i[33021,33034] [2022-07-14 12:51:02,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:02,576 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 12:51:02,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f77d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:02, skipping insertion in model container [2022-07-14 12:51:02,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:02,578 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 12:51:02,580 INFO L158 Benchmark]: Toolchain (without parser) took 526.95ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 76.4MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 12:51:02,581 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 25.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 12:51:02,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.76ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 76.4MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 12:51:02,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 79.7MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 25.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.76ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 76.4MB in the end (delta: -4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 12:51:04,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 12:51:04,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 12:51:04,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 12:51:04,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 12:51:04,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 12:51:04,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 12:51:04,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 12:51:04,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 12:51:04,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 12:51:04,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 12:51:04,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 12:51:04,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 12:51:04,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 12:51:04,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 12:51:04,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 12:51:04,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 12:51:04,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 12:51:04,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 12:51:04,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 12:51:04,422 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 12:51:04,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 12:51:04,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 12:51:04,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 12:51:04,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 12:51:04,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 12:51:04,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 12:51:04,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 12:51:04,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 12:51:04,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 12:51:04,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 12:51:04,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 12:51:04,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 12:51:04,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 12:51:04,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 12:51:04,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 12:51:04,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 12:51:04,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 12:51:04,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 12:51:04,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 12:51:04,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 12:51:04,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 12:51:04,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 12:51:04,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 12:51:04,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 12:51:04,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 12:51:04,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 12:51:04,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 12:51:04,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 12:51:04,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 12:51:04,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 12:51:04,496 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 12:51:04,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 12:51:04,497 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 12:51:04,497 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 12:51:04,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 12:51:04,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 12:51:04,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 12:51:04,498 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 12:51:04,499 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 12:51:04,499 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 12:51:04,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 12:51:04,499 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 12:51:04,500 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 12:51:04,500 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 12:51:04,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 12:51:04,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 12:51:04,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 12:51:04,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 12:51:04,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 12:51:04,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:51:04,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 12:51:04,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 12:51:04,502 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 12:51:04,502 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 12:51:04,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 12:51:04,503 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 [2022-07-14 12:51:04,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 12:51:04,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 12:51:04,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 12:51:04,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 12:51:04,840 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 12:51:04,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2022-07-14 12:51:04,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc6f679d/47a1535fa4b1419ab6d195a6e3ef900d/FLAGf2c2e30f1 [2022-07-14 12:51:05,429 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 12:51:05,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2022-07-14 12:51:05,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc6f679d/47a1535fa4b1419ab6d195a6e3ef900d/FLAGf2c2e30f1 [2022-07-14 12:51:05,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc6f679d/47a1535fa4b1419ab6d195a6e3ef900d [2022-07-14 12:51:05,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 12:51:05,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 12:51:05,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:05,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 12:51:05,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 12:51:05,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:05" (1/1) ... [2022-07-14 12:51:05,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235469d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:05, skipping insertion in model container [2022-07-14 12:51:05,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:51:05" (1/1) ... [2022-07-14 12:51:05,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 12:51:05,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:51:06,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i[33021,33034] [2022-07-14 12:51:06,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:06,266 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 12:51:06,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 12:51:06,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i[33021,33034] [2022-07-14 12:51:06,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:06,369 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 12:51:06,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i[33021,33034] [2022-07-14 12:51:06,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 12:51:06,503 INFO L208 MainTranslator]: Completed translation [2022-07-14 12:51:06,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06 WrapperNode [2022-07-14 12:51:06,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 12:51:06,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 12:51:06,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 12:51:06,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 12:51:06,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,589 INFO L137 Inliner]: procedures = 180, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 792 [2022-07-14 12:51:06,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 12:51:06,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 12:51:06,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 12:51:06,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 12:51:06,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 12:51:06,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 12:51:06,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 12:51:06,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 12:51:06,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (1/1) ... [2022-07-14 12:51:06,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 12:51:06,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 12:51:06,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 12:51:06,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 12:51:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 12:51:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 12:51:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 12:51:06,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 12:51:06,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 12:51:06,752 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 12:51:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 12:51:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 12:51:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 12:51:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 12:51:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 12:51:06,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 12:51:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 12:51:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 12:51:06,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 12:51:06,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 12:51:06,900 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 12:51:06,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 12:51:06,905 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 12:51:09,813 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 12:51:09,826 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 12:51:09,826 INFO L299 CfgBuilder]: Removed 40 assume(true) statements. [2022-07-14 12:51:09,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:51:09 BoogieIcfgContainer [2022-07-14 12:51:09,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 12:51:09,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 12:51:09,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 12:51:09,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 12:51:09,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:51:05" (1/3) ... [2022-07-14 12:51:09,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6fba79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:51:09, skipping insertion in model container [2022-07-14 12:51:09,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:51:06" (2/3) ... [2022-07-14 12:51:09,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6fba79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:51:09, skipping insertion in model container [2022-07-14 12:51:09,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:51:09" (3/3) ... [2022-07-14 12:51:09,843 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-2.i [2022-07-14 12:51:09,856 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 12:51:09,856 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2022-07-14 12:51:09,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 12:51:09,933 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@46ee53c1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f8a9303 [2022-07-14 12:51:09,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2022-07-14 12:51:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 419 states have (on average 2.252983293556086) internal successors, (944), 861 states have internal predecessors, (944), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:51:09,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:09,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:51:09,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-14 12:51:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927626670] [2022-07-14 12:51:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:09,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:09,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:09,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 12:51:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:10,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 12:51:10,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:10,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:10,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:10,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927626670] [2022-07-14 12:51:10,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927626670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:10,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:10,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350839884] [2022-07-14 12:51:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:10,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 12:51:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 12:51:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 12:51:10,190 INFO L87 Difference]: Start difference. First operand has 867 states, 419 states have (on average 2.252983293556086) internal successors, (944), 861 states have internal predecessors, (944), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:10,247 INFO L93 Difference]: Finished difference Result 858 states and 916 transitions. [2022-07-14 12:51:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 12:51:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:51:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:10,272 INFO L225 Difference]: With dead ends: 858 [2022-07-14 12:51:10,272 INFO L226 Difference]: Without dead ends: 856 [2022-07-14 12:51:10,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 12:51:10,276 INFO L413 NwaCegarLoop]: 916 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:10,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-07-14 12:51:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2022-07-14 12:51:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 414 states have (on average 2.1449275362318843) internal successors, (888), 850 states have internal predecessors, (888), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 914 transitions. [2022-07-14 12:51:10,348 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 914 transitions. Word has length 5 [2022-07-14 12:51:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:10,348 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 914 transitions. [2022-07-14 12:51:10,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 914 transitions. [2022-07-14 12:51:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:51:10,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:10,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:51:10,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:10,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:10,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-14 12:51:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:10,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183253007] [2022-07-14 12:51:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:10,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:10,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:10,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:10,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 12:51:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:10,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:10,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:10,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:10,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:10,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:10,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183253007] [2022-07-14 12:51:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183253007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:10,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:10,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208329075] [2022-07-14 12:51:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:10,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:10,796 INFO L87 Difference]: Start difference. First operand 856 states and 914 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:12,062 INFO L93 Difference]: Finished difference Result 814 states and 873 transitions. [2022-07-14 12:51:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:12,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:51:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:12,067 INFO L225 Difference]: With dead ends: 814 [2022-07-14 12:51:12,067 INFO L226 Difference]: Without dead ends: 814 [2022-07-14 12:51:12,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:12,069 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 596 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:12,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 662 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 12:51:12,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-14 12:51:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 807. [2022-07-14 12:51:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 414 states have (on average 2.026570048309179) internal successors, (839), 801 states have internal predecessors, (839), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 865 transitions. [2022-07-14 12:51:12,094 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 865 transitions. Word has length 5 [2022-07-14 12:51:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:12,094 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 865 transitions. [2022-07-14 12:51:12,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 865 transitions. [2022-07-14 12:51:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 12:51:12,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:12,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 12:51:12,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:12,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:12,305 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-14 12:51:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:12,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757243360] [2022-07-14 12:51:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:12,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:12,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:12,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:12,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 12:51:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:12,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:12,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:12,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:12,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:12,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757243360] [2022-07-14 12:51:12,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757243360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:12,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:12,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 12:51:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143805085] [2022-07-14 12:51:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:12,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:12,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:12,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:12,448 INFO L87 Difference]: Start difference. First operand 807 states and 865 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:13,785 INFO L93 Difference]: Finished difference Result 874 states and 936 transitions. [2022-07-14 12:51:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 12:51:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:13,789 INFO L225 Difference]: With dead ends: 874 [2022-07-14 12:51:13,790 INFO L226 Difference]: Without dead ends: 874 [2022-07-14 12:51:13,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:13,791 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 254 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:13,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1065 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 12:51:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-07-14 12:51:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 829. [2022-07-14 12:51:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 446 states have (on average 2.006726457399103) internal successors, (895), 823 states have internal predecessors, (895), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 921 transitions. [2022-07-14 12:51:13,810 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 921 transitions. Word has length 5 [2022-07-14 12:51:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:13,810 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 921 transitions. [2022-07-14 12:51:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 921 transitions. [2022-07-14 12:51:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 12:51:13,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:13,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 12:51:13,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:14,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:14,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1156735106, now seen corresponding path program 1 times [2022-07-14 12:51:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:14,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553636456] [2022-07-14 12:51:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:14,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:14,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 12:51:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:14,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:51:14,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:14,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:14,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:14,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553636456] [2022-07-14 12:51:14,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553636456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:14,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:14,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:14,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129259073] [2022-07-14 12:51:14,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:14,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:14,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:14,110 INFO L87 Difference]: Start difference. First operand 829 states and 921 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:14,183 INFO L93 Difference]: Finished difference Result 1410 states and 1563 transitions. [2022-07-14 12:51:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 12:51:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:14,196 INFO L225 Difference]: With dead ends: 1410 [2022-07-14 12:51:14,196 INFO L226 Difference]: Without dead ends: 1410 [2022-07-14 12:51:14,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:14,200 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 569 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:14,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1925 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:51:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-07-14 12:51:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 830. [2022-07-14 12:51:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 447 states have (on average 2.004474272930649) internal successors, (896), 824 states have internal predecessors, (896), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 922 transitions. [2022-07-14 12:51:14,227 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 922 transitions. Word has length 6 [2022-07-14 12:51:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:14,230 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 922 transitions. [2022-07-14 12:51:14,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 922 transitions. [2022-07-14 12:51:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 12:51:14,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:14,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:14,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:14,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:14,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-14 12:51:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:14,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172225715] [2022-07-14 12:51:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:14,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:14,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 12:51:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:14,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 12:51:14,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:14,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:14,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:14,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172225715] [2022-07-14 12:51:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172225715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:14,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:14,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883705619] [2022-07-14 12:51:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:14,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:14,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:14,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:14,574 INFO L87 Difference]: Start difference. First operand 830 states and 922 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:14,602 INFO L93 Difference]: Finished difference Result 794 states and 885 transitions. [2022-07-14 12:51:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 12:51:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:14,605 INFO L225 Difference]: With dead ends: 794 [2022-07-14 12:51:14,605 INFO L226 Difference]: Without dead ends: 794 [2022-07-14 12:51:14,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:14,606 INFO L413 NwaCegarLoop]: 807 mSDtfsCounter, 773 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:14,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 837 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-14 12:51:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 788. [2022-07-14 12:51:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 429 states have (on average 1.9883449883449884) internal successors, (853), 782 states have internal predecessors, (853), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 879 transitions. [2022-07-14 12:51:14,622 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 879 transitions. Word has length 11 [2022-07-14 12:51:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:14,623 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 879 transitions. [2022-07-14 12:51:14,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 879 transitions. [2022-07-14 12:51:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 12:51:14,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:14,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:14,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:14,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:14,834 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-14 12:51:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553534629] [2022-07-14 12:51:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:14,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:14,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 12:51:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:14,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:14,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:14,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:14,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:14,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553534629] [2022-07-14 12:51:14,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553534629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:14,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:14,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900723746] [2022-07-14 12:51:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:14,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:14,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:14,962 INFO L87 Difference]: Start difference. First operand 788 states and 879 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:15,034 INFO L93 Difference]: Finished difference Result 773 states and 857 transitions. [2022-07-14 12:51:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 12:51:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:15,038 INFO L225 Difference]: With dead ends: 773 [2022-07-14 12:51:15,038 INFO L226 Difference]: Without dead ends: 773 [2022-07-14 12:51:15,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:15,039 INFO L413 NwaCegarLoop]: 762 mSDtfsCounter, 744 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:15,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1547 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-14 12:51:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 766. [2022-07-14 12:51:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 421 states have (on average 1.9572446555819478) internal successors, (824), 760 states have internal predecessors, (824), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 850 transitions. [2022-07-14 12:51:15,056 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 850 transitions. Word has length 13 [2022-07-14 12:51:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:15,057 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 850 transitions. [2022-07-14 12:51:15,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 850 transitions. [2022-07-14 12:51:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:51:15,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:15,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:15,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-14 12:51:15,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:15,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-14 12:51:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:15,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837524928] [2022-07-14 12:51:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:15,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:15,271 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 12:51:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:15,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:15,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:15,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:15,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:15,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:15,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837524928] [2022-07-14 12:51:15,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837524928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:15,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:15,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129384864] [2022-07-14 12:51:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:15,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:15,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:15,451 INFO L87 Difference]: Start difference. First operand 766 states and 850 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:17,064 INFO L93 Difference]: Finished difference Result 993 states and 1108 transitions. [2022-07-14 12:51:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:51:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:51:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:17,069 INFO L225 Difference]: With dead ends: 993 [2022-07-14 12:51:17,069 INFO L226 Difference]: Without dead ends: 993 [2022-07-14 12:51:17,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:17,069 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 1151 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:17,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 718 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 12:51:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-07-14 12:51:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 762. [2022-07-14 12:51:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 421 states have (on average 1.9477434679334917) internal successors, (820), 756 states have internal predecessors, (820), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 846 transitions. [2022-07-14 12:51:17,086 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 846 transitions. Word has length 27 [2022-07-14 12:51:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:17,087 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 846 transitions. [2022-07-14 12:51:17,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 846 transitions. [2022-07-14 12:51:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 12:51:17,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:17,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:17,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:17,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:17,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-14 12:51:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:17,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018802114] [2022-07-14 12:51:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:17,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:17,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 12:51:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:17,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 12:51:17,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:17,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:17,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:17,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:17,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018802114] [2022-07-14 12:51:17,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018802114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:17,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:17,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410538196] [2022-07-14 12:51:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:17,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:17,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:17,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:17,564 INFO L87 Difference]: Start difference. First operand 762 states and 846 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:19,789 INFO L93 Difference]: Finished difference Result 1043 states and 1128 transitions. [2022-07-14 12:51:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 12:51:19,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 12:51:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:19,794 INFO L225 Difference]: With dead ends: 1043 [2022-07-14 12:51:19,794 INFO L226 Difference]: Without dead ends: 1043 [2022-07-14 12:51:19,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:19,794 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 561 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:19,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1254 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 12:51:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-07-14 12:51:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 758. [2022-07-14 12:51:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 421 states have (on average 1.9382422802850356) internal successors, (816), 752 states have internal predecessors, (816), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 842 transitions. [2022-07-14 12:51:19,810 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 842 transitions. Word has length 27 [2022-07-14 12:51:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:19,811 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 842 transitions. [2022-07-14 12:51:19,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 842 transitions. [2022-07-14 12:51:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 12:51:19,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:19,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:19,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-14 12:51:20,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:20,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-14 12:51:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:20,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031105623] [2022-07-14 12:51:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:20,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:20,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 12:51:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:20,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:20,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:20,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:20,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:20,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031105623] [2022-07-14 12:51:20,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031105623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:20,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:20,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711748646] [2022-07-14 12:51:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:20,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:20,227 INFO L87 Difference]: Start difference. First operand 758 states and 842 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:20,268 INFO L93 Difference]: Finished difference Result 758 states and 838 transitions. [2022-07-14 12:51:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:20,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 12:51:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:20,272 INFO L225 Difference]: With dead ends: 758 [2022-07-14 12:51:20,272 INFO L226 Difference]: Without dead ends: 758 [2022-07-14 12:51:20,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:20,273 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 720 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:20,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1525 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-07-14 12:51:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 752. [2022-07-14 12:51:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 415 states have (on average 1.9421686746987952) internal successors, (806), 746 states have internal predecessors, (806), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 832 transitions. [2022-07-14 12:51:20,287 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 832 transitions. Word has length 42 [2022-07-14 12:51:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:20,287 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 832 transitions. [2022-07-14 12:51:20,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 832 transitions. [2022-07-14 12:51:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 12:51:20,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:20,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:20,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:20,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:20,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-14 12:51:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:20,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166098775] [2022-07-14 12:51:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:20,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:20,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:20,502 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:20,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 12:51:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:20,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:20,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:20,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:20,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166098775] [2022-07-14 12:51:20,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166098775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:20,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:20,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594420793] [2022-07-14 12:51:20,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:20,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 12:51:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:20,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 12:51:20,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:20,847 INFO L87 Difference]: Start difference. First operand 752 states and 832 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:21,032 INFO L93 Difference]: Finished difference Result 993 states and 1082 transitions. [2022-07-14 12:51:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 12:51:21,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-14 12:51:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:21,037 INFO L225 Difference]: With dead ends: 993 [2022-07-14 12:51:21,037 INFO L226 Difference]: Without dead ends: 993 [2022-07-14 12:51:21,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 12:51:21,038 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 269 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:21,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1465 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:51:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-07-14 12:51:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 798. [2022-07-14 12:51:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 461 states have (on average 1.8481561822125814) internal successors, (852), 792 states have internal predecessors, (852), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 878 transitions. [2022-07-14 12:51:21,055 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 878 transitions. Word has length 50 [2022-07-14 12:51:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:21,055 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 878 transitions. [2022-07-14 12:51:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 878 transitions. [2022-07-14 12:51:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 12:51:21,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:21,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:21,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:21,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:21,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-14 12:51:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:21,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324256320] [2022-07-14 12:51:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:21,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:21,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:21,275 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:21,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 12:51:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 12:51:21,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:21,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:21,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:21,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 12:51:21,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 12:51:21,898 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:51:21,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 12:51:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:21,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:21,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:21,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324256320] [2022-07-14 12:51:21,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324256320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:21,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:21,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 12:51:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386696706] [2022-07-14 12:51:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:21,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:21,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:21,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:21,917 INFO L87 Difference]: Start difference. First operand 798 states and 878 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:23,161 INFO L93 Difference]: Finished difference Result 767 states and 848 transitions. [2022-07-14 12:51:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-14 12:51:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:23,164 INFO L225 Difference]: With dead ends: 767 [2022-07-14 12:51:23,164 INFO L226 Difference]: Without dead ends: 767 [2022-07-14 12:51:23,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:23,165 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 441 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:23,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 677 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 12:51:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-07-14 12:51:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 728. [2022-07-14 12:51:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 429 states have (on average 1.7435897435897436) internal successors, (748), 722 states have internal predecessors, (748), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 774 transitions. [2022-07-14 12:51:23,180 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 774 transitions. Word has length 53 [2022-07-14 12:51:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:23,180 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 774 transitions. [2022-07-14 12:51:23,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 774 transitions. [2022-07-14 12:51:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:51:23,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:23,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:23,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:23,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:23,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-14 12:51:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:23,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569816535] [2022-07-14 12:51:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:23,399 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:23,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 12:51:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:23,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:51:23,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:23,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:23,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:51:23,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:51:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:23,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:23,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569816535] [2022-07-14 12:51:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569816535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:23,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:23,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128704230] [2022-07-14 12:51:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:23,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:51:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:51:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:23,660 INFO L87 Difference]: Start difference. First operand 728 states and 774 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:24,892 INFO L93 Difference]: Finished difference Result 727 states and 773 transitions. [2022-07-14 12:51:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:51:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 12:51:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:24,895 INFO L225 Difference]: With dead ends: 727 [2022-07-14 12:51:24,895 INFO L226 Difference]: Without dead ends: 727 [2022-07-14 12:51:24,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:51:24,896 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 4 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:24,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1850 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 12:51:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-07-14 12:51:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2022-07-14 12:51:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 429 states have (on average 1.7412587412587412) internal successors, (747), 721 states have internal predecessors, (747), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 773 transitions. [2022-07-14 12:51:24,907 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 773 transitions. Word has length 58 [2022-07-14 12:51:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:24,907 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 773 transitions. [2022-07-14 12:51:24,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 773 transitions. [2022-07-14 12:51:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 12:51:24,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:24,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:24,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:25,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:25,120 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-14 12:51:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:25,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12436918] [2022-07-14 12:51:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:25,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:25,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:25,123 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:25,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 12:51:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:25,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 12:51:25,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:25,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:51:25,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:51:25,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:51:25,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 12:51:25,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 12:51:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:25,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:25,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:25,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12436918] [2022-07-14 12:51:25,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12436918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:25,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:25,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197734896] [2022-07-14 12:51:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:25,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 12:51:25,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:25,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 12:51:25,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:25,441 INFO L87 Difference]: Start difference. First operand 727 states and 773 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:27,212 INFO L93 Difference]: Finished difference Result 726 states and 772 transitions. [2022-07-14 12:51:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 12:51:27,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 12:51:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:27,216 INFO L225 Difference]: With dead ends: 726 [2022-07-14 12:51:27,216 INFO L226 Difference]: Without dead ends: 726 [2022-07-14 12:51:27,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 12:51:27,216 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 2 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:27,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1876 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 12:51:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-14 12:51:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2022-07-14 12:51:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 428 states have (on average 1.7429906542056075) internal successors, (746), 720 states have internal predecessors, (746), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 12:51:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 772 transitions. [2022-07-14 12:51:27,227 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 772 transitions. Word has length 58 [2022-07-14 12:51:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:27,228 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 772 transitions. [2022-07-14 12:51:27,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 12:51:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 772 transitions. [2022-07-14 12:51:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 12:51:27,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:27,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:27,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:27,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:27,441 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1238792034, now seen corresponding path program 1 times [2022-07-14 12:51:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:27,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877760827] [2022-07-14 12:51:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:27,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:27,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:27,443 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:27,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 12:51:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:27,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 12:51:27,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:27,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 12:51:27,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:27,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877760827] [2022-07-14 12:51:27,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877760827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 12:51:27,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 12:51:27,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 12:51:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032027470] [2022-07-14 12:51:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 12:51:27,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 12:51:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 12:51:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 12:51:27,669 INFO L87 Difference]: Start difference. First operand 726 states and 772 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 12:51:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:27,703 INFO L93 Difference]: Finished difference Result 729 states and 776 transitions. [2022-07-14 12:51:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 12:51:27,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-07-14 12:51:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:27,706 INFO L225 Difference]: With dead ends: 729 [2022-07-14 12:51:27,706 INFO L226 Difference]: Without dead ends: 729 [2022-07-14 12:51:27,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 12:51:27,707 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 2 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:27,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2161 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 12:51:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-07-14 12:51:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2022-07-14 12:51:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 430 states have (on average 1.741860465116279) internal successors, (749), 723 states have internal predecessors, (749), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 12:51:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 776 transitions. [2022-07-14 12:51:27,719 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 776 transitions. Word has length 66 [2022-07-14 12:51:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:27,720 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 776 transitions. [2022-07-14 12:51:27,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 12:51:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 776 transitions. [2022-07-14 12:51:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 12:51:27,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:27,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:27,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:27,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:27,940 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1572130281, now seen corresponding path program 1 times [2022-07-14 12:51:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:27,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509611392] [2022-07-14 12:51:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:51:27,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:27,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:27,943 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:27,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 12:51:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:51:28,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 12:51:28,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:28,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:51:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:28,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:28,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509611392] [2022-07-14 12:51:28,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509611392] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:51:28,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:51:28,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 12:51:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117653546] [2022-07-14 12:51:28,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:51:28,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 12:51:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:28,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 12:51:28,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 12:51:28,310 INFO L87 Difference]: Start difference. First operand 729 states and 776 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:28,422 INFO L93 Difference]: Finished difference Result 741 states and 793 transitions. [2022-07-14 12:51:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 12:51:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-14 12:51:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:28,424 INFO L225 Difference]: With dead ends: 741 [2022-07-14 12:51:28,424 INFO L226 Difference]: Without dead ends: 741 [2022-07-14 12:51:28,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-14 12:51:28,425 INFO L413 NwaCegarLoop]: 723 mSDtfsCounter, 17 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:28,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 12:51:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-14 12:51:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2022-07-14 12:51:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 439 states have (on average 1.7403189066059226) internal successors, (764), 732 states have internal predecessors, (764), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 12:51:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 791 transitions. [2022-07-14 12:51:28,437 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 791 transitions. Word has length 67 [2022-07-14 12:51:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:28,438 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 791 transitions. [2022-07-14 12:51:28,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 791 transitions. [2022-07-14 12:51:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 12:51:28,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:28,439 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:28,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:28,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:28,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -512359586, now seen corresponding path program 2 times [2022-07-14 12:51:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:28,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624177343] [2022-07-14 12:51:28,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 12:51:28,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:28,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:28,653 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:28,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 12:51:29,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 12:51:29,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:51:29,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 12:51:29,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:29,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:51:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:29,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624177343] [2022-07-14 12:51:29,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624177343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:51:29,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:51:29,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-14 12:51:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192315050] [2022-07-14 12:51:29,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:51:29,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 12:51:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 12:51:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 12:51:29,273 INFO L87 Difference]: Start difference. First operand 739 states and 791 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:29,821 INFO L93 Difference]: Finished difference Result 760 states and 819 transitions. [2022-07-14 12:51:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 12:51:29,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-14 12:51:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:29,823 INFO L225 Difference]: With dead ends: 760 [2022-07-14 12:51:29,823 INFO L226 Difference]: Without dead ends: 756 [2022-07-14 12:51:29,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-14 12:51:29,824 INFO L413 NwaCegarLoop]: 726 mSDtfsCounter, 56 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:29,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4340 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 12:51:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-14 12:51:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 748. [2022-07-14 12:51:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 448 states have (on average 1.7321428571428572) internal successors, (776), 741 states have internal predecessors, (776), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 12:51:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 803 transitions. [2022-07-14 12:51:29,836 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 803 transitions. Word has length 70 [2022-07-14 12:51:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 803 transitions. [2022-07-14 12:51:29,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 803 transitions. [2022-07-14 12:51:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 12:51:29,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:29,837 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:29,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:30,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:30,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash 417359742, now seen corresponding path program 3 times [2022-07-14 12:51:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:30,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191639202] [2022-07-14 12:51:30,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 12:51:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:30,054 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:30,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 12:51:30,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 12:51:30,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:51:30,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 12:51:30,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:30,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:51:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:31,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:31,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191639202] [2022-07-14 12:51:31,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191639202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:51:31,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:51:31,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-14 12:51:31,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385670621] [2022-07-14 12:51:31,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:51:31,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 12:51:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:31,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 12:51:31,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 12:51:31,494 INFO L87 Difference]: Start difference. First operand 748 states and 803 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:34,038 INFO L93 Difference]: Finished difference Result 790 states and 865 transitions. [2022-07-14 12:51:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 12:51:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-14 12:51:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:34,042 INFO L225 Difference]: With dead ends: 790 [2022-07-14 12:51:34,042 INFO L226 Difference]: Without dead ends: 784 [2022-07-14 12:51:34,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 12:51:34,043 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 188 mSDsluCounter, 8714 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 9445 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:34,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 9445 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 12:51:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-14 12:51:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 766. [2022-07-14 12:51:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 466 states have (on average 1.7145922746781115) internal successors, (799), 759 states have internal predecessors, (799), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 12:51:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 826 transitions. [2022-07-14 12:51:34,056 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 826 transitions. Word has length 76 [2022-07-14 12:51:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:34,057 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 826 transitions. [2022-07-14 12:51:34,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 826 transitions. [2022-07-14 12:51:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 12:51:34,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:34,058 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:34,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-14 12:51:34,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:34,273 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:34,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1945344066, now seen corresponding path program 4 times [2022-07-14 12:51:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:34,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425492682] [2022-07-14 12:51:34,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 12:51:34,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:34,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:34,276 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:34,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 12:51:34,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 12:51:34,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:51:34,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 12:51:34,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:34,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:51:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 12:51:36,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425492682] [2022-07-14 12:51:36,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425492682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 12:51:36,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:51:36,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-14 12:51:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046132868] [2022-07-14 12:51:36,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:51:36,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 12:51:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:51:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 12:51:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 12:51:36,362 INFO L87 Difference]: Start difference. First operand 766 states and 826 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:51:46,166 INFO L93 Difference]: Finished difference Result 846 states and 938 transitions. [2022-07-14 12:51:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-14 12:51:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-14 12:51:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:51:46,170 INFO L225 Difference]: With dead ends: 846 [2022-07-14 12:51:46,170 INFO L226 Difference]: Without dead ends: 842 [2022-07-14 12:51:46,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-14 12:51:46,173 INFO L413 NwaCegarLoop]: 743 mSDtfsCounter, 360 mSDsluCounter, 19151 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 19894 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 12:51:46,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 19894 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 12:51:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-14 12:51:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2022-07-14 12:51:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 500 states have (on average 1.69) internal successors, (845), 793 states have internal predecessors, (845), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-14 12:51:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 872 transitions. [2022-07-14 12:51:46,188 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 872 transitions. Word has length 88 [2022-07-14 12:51:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:51:46,189 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 872 transitions. [2022-07-14 12:51:46,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 12:51:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 872 transitions. [2022-07-14 12:51:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 12:51:46,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:51:46,190 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:51:46,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 12:51:46,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 12:51:46,403 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:51:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:51:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1730227934, now seen corresponding path program 5 times [2022-07-14 12:51:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:51:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041357218] [2022-07-14 12:51:46,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:51:46,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:51:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:51:46,407 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:51:46,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 12:51:47,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:51:47,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:51:47,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 12:51:47,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:51:47,641 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 12:51:47,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-14 12:51:47,917 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 12:51:47,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-14 12:51:47,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:51:48,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-14 12:51:51,019 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1578)))) is different from true [2022-07-14 12:51:52,719 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1590 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1590) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:51:53,891 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1599) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:51:54,659 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1605 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1605)))) is different from true [2022-07-14 12:51:54,873 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:51:54,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-07-14 12:51:55,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-07-14 12:51:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-07-14 12:51:55,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:51:55,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-14 12:51:55,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:51:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041357218] [2022-07-14 12:51:55,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041357218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:51:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1311898583] [2022-07-14 12:51:55,410 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 12:51:55,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:51:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:51:55,412 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:51:55,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-14 12:53:21,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 12:53:21,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 12:53:21,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 12:53:21,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:21,445 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 12:53:21,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 12:53:21,626 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 12:53:21,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-14 12:53:21,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:21,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-14 12:53:24,104 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:53:24,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-14 12:53:24,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-14 12:53:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-14 12:53:24,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:24,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-14 12:53:24,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1311898583] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:53:24,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 12:53:24,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 20 [2022-07-14 12:53:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115986862] [2022-07-14 12:53:24,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 12:53:24,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 12:53:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 12:53:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 12:53:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=305, Unknown=29, NotChecked=246, Total=650 [2022-07-14 12:53:24,419 INFO L87 Difference]: Start difference. First operand 800 states and 872 transitions. Second operand has 22 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 12:53:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 12:53:28,132 INFO L93 Difference]: Finished difference Result 1464 states and 1583 transitions. [2022-07-14 12:53:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 12:53:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-07-14 12:53:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 12:53:28,141 INFO L225 Difference]: With dead ends: 1464 [2022-07-14 12:53:28,141 INFO L226 Difference]: Without dead ends: 1460 [2022-07-14 12:53:28,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 117 SyntacticMatches, 89 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=156, Invalid=633, Unknown=47, NotChecked=354, Total=1190 [2022-07-14 12:53:28,142 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 1092 mSDsluCounter, 4049 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 4481 SdHoareTripleChecker+Invalid, 8798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6193 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 12:53:28,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 4481 Invalid, 8798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2571 Invalid, 0 Unknown, 6193 Unchecked, 3.2s Time] [2022-07-14 12:53:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2022-07-14 12:53:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 992. [2022-07-14 12:53:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 982 states have internal predecessors, (1111), 15 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-14 12:53:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1142 transitions. [2022-07-14 12:53:28,160 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1142 transitions. Word has length 110 [2022-07-14 12:53:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 12:53:28,160 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1142 transitions. [2022-07-14 12:53:28,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.315789473684211) internal successors, (139), 21 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 12:53:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1142 transitions. [2022-07-14 12:53:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 12:53:28,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 12:53:28,162 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 12:53:28,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-14 12:53:28,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-14 12:53:28,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 12:53:28,576 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-14 12:53:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 12:53:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1730227935, now seen corresponding path program 1 times [2022-07-14 12:53:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 12:53:28,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669745826] [2022-07-14 12:53:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:28,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 12:53:28,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 12:53:28,578 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 12:53:28,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 12:53:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 12:53:29,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-14 12:53:29,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 12:53:29,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:29,481 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 12:53:29,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 12:53:29,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 12:53:29,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:29,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 12:53:29,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 12:53:29,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 12:53:29,628 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-07-14 12:53:29,636 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459)))) is different from true [2022-07-14 12:53:29,643 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:53:29,657 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:53:29,666 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-07-14 12:53:29,675 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467)))) is different from true [2022-07-14 12:53:29,707 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:53:29,714 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472)))) is different from true [2022-07-14 12:53:29,742 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476)))) is different from true [2022-07-14 12:53:29,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:53:29,760 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:53:29,768 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:29,775 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-14 12:53:29,782 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486)))) is different from true [2022-07-14 12:53:29,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490)))) is different from true [2022-07-14 12:53:29,814 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:53:29,822 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-14 12:53:29,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:29,854 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-14 12:53:29,862 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-14 12:53:29,889 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:53:29,899 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:53:29,909 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-14 12:53:29,917 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-14 12:53:29,924 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 12:53:29,931 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516)))) is different from true [2022-07-14 12:53:29,938 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-14 12:53:29,985 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:53:30,017 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 12:53:30,025 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-14 12:53:30,032 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-14 12:53:30,039 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-14 12:53:30,057 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:53:30,065 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 12:53:30,130 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 12:53:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 12:53:30,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 12:53:30,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 12:53:30,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 12:53:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 935 not checked. [2022-07-14 12:53:30,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 12:53:30,866 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-14 12:53:30,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 12:53:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669745826] [2022-07-14 12:53:30,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669745826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 12:53:30,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206544532] [2022-07-14 12:53:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 12:53:30,872 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 12:53:30,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 12:53:30,873 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 12:53:30,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process