./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:39:28,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:39:28,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:39:28,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:39:28,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:39:28,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:39:28,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:39:28,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:39:29,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:39:29,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:39:29,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:39:29,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:39:29,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:39:29,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:39:29,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:39:29,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:39:29,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:39:29,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:39:29,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:39:29,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:39:29,030 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:39:29,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:39:29,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:39:29,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:39:29,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:39:29,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:39:29,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:39:29,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:39:29,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:39:29,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:39:29,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:39:29,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:39:29,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:39:29,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:39:29,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:39:29,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:39:29,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:39:29,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:39:29,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:39:29,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:39:29,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:39:29,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:39:29,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-21 23:39:29,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:39:29,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:39:29,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:39:29,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:39:29,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:39:29,087 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:39:29,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:39:29,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:39:29,088 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:39:29,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:39:29,089 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:39:29,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:39:29,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:39:29,089 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:39:29,090 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:39:29,090 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:39:29,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:39:29,090 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:39:29,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:39:29,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:39:29,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:39:29,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:39:29,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:39:29,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:39:29,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:39:29,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 23:39:29,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 23:39:29,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2022-07-21 23:39:29,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:39:29,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:39:29,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:39:29,410 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:39:29,411 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:39:29,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-21 23:39:29,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44137269f/5dd34cfb63e24cdba952c3dea5286546/FLAGae9a83619 [2022-07-21 23:39:30,002 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:39:30,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-21 23:39:30,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44137269f/5dd34cfb63e24cdba952c3dea5286546/FLAGae9a83619 [2022-07-21 23:39:30,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44137269f/5dd34cfb63e24cdba952c3dea5286546 [2022-07-21 23:39:30,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:39:30,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:39:30,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:30,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:39:30,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:39:30,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:30" (1/1) ... [2022-07-21 23:39:30,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b5051f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:30, skipping insertion in model container [2022-07-21 23:39:30,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:30" (1/1) ... [2022-07-21 23:39:30,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:39:30,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:39:30,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-21 23:39:30,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:30,832 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-21 23:39:30,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38049012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:30, skipping insertion in model container [2022-07-21 23:39:30,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:30,833 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 23:39:30,835 INFO L158 Benchmark]: Toolchain (without parser) took 551.43ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.2MB in the beginning and 43.6MB in the end (delta: -16.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-07-21 23:39:30,843 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 33.5MB in the beginning and 33.4MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 23:39:30,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.78ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.0MB in the beginning and 43.6MB in the end (delta: -16.6MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-07-21 23:39:30,847 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 33.5MB in the beginning and 33.4MB in the end (delta: 47.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.78ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.0MB in the beginning and 43.6MB in the end (delta: -16.6MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 23:39:32,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 23:39:32,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 23:39:32,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 23:39:32,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 23:39:32,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 23:39:32,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 23:39:32,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 23:39:32,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 23:39:32,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 23:39:32,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 23:39:32,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 23:39:32,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 23:39:32,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 23:39:32,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 23:39:32,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 23:39:32,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 23:39:32,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 23:39:32,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 23:39:32,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 23:39:32,521 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 23:39:32,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 23:39:32,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 23:39:32,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 23:39:32,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 23:39:32,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 23:39:32,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 23:39:32,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 23:39:32,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 23:39:32,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 23:39:32,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 23:39:32,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 23:39:32,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 23:39:32,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 23:39:32,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 23:39:32,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 23:39:32,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 23:39:32,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 23:39:32,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 23:39:32,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 23:39:32,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 23:39:32,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 23:39:32,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-21 23:39:32,581 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 23:39:32,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 23:39:32,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 23:39:32,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 23:39:32,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 23:39:32,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 23:39:32,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 23:39:32,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 23:39:32,584 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 23:39:32,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 23:39:32,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 23:39:32,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 23:39:32,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 23:39:32,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 23:39:32,585 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 23:39:32,592 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 23:39:32,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 23:39:32,593 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 23:39:32,593 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 23:39:32,593 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 23:39:32,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 23:39:32,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 23:39:32,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 23:39:32,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 23:39:32,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:39:32,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 23:39:32,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 23:39:32,595 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 23:39:32,595 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 23:39:32,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 23:39:32,596 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2022-07-21 23:39:32,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 23:39:32,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 23:39:32,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 23:39:32,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 23:39:32,945 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 23:39:32,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-21 23:39:33,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b322dc547/f74679c3091f4b11b9fdd532da39debb/FLAGca03f7475 [2022-07-21 23:39:33,493 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 23:39:33,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-21 23:39:33,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b322dc547/f74679c3091f4b11b9fdd532da39debb/FLAGca03f7475 [2022-07-21 23:39:34,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b322dc547/f74679c3091f4b11b9fdd532da39debb [2022-07-21 23:39:34,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 23:39:34,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 23:39:34,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:34,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 23:39:34,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 23:39:34,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9380857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34, skipping insertion in model container [2022-07-21 23:39:34,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 23:39:34,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:39:34,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-21 23:39:34,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:34,542 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 23:39:34,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 23:39:34,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-21 23:39:34,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:34,671 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 23:39:34,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-21 23:39:34,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 23:39:34,840 INFO L208 MainTranslator]: Completed translation [2022-07-21 23:39:34,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34 WrapperNode [2022-07-21 23:39:34,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 23:39:34,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 23:39:34,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 23:39:34,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 23:39:34,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,947 INFO L137 Inliner]: procedures = 353, calls = 114, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 386 [2022-07-21 23:39:34,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 23:39:34,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 23:39:34,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 23:39:34,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 23:39:34,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:34,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:35,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:35,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 23:39:35,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 23:39:35,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 23:39:35,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 23:39:35,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (1/1) ... [2022-07-21 23:39:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 23:39:35,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 23:39:35,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 23:39:35,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 23:39:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-21 23:39:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 23:39:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 23:39:35,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 23:39:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 23:39:35,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-21 23:39:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 23:39:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 23:39:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 23:39:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-21 23:39:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 23:39:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-07-21 23:39:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 23:39:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 23:39:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 23:39:35,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 23:39:35,442 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 23:39:35,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 23:39:36,452 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 23:39:36,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 23:39:36,458 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-21 23:39:36,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:39:36 BoogieIcfgContainer [2022-07-21 23:39:36,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 23:39:36,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 23:39:36,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 23:39:36,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 23:39:36,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:39:34" (1/3) ... [2022-07-21 23:39:36,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:39:36, skipping insertion in model container [2022-07-21 23:39:36,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:39:34" (2/3) ... [2022-07-21 23:39:36,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6100c3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:39:36, skipping insertion in model container [2022-07-21 23:39:36,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:39:36" (3/3) ... [2022-07-21 23:39:36,469 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-2.i [2022-07-21 23:39:36,481 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 23:39:36,481 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2022-07-21 23:39:36,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 23:39:36,545 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@2cc2add3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58357646 [2022-07-21 23:39:36,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2022-07-21 23:39:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 23:39:36,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:36,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 23:39:36,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2022-07-21 23:39:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:36,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530167931] [2022-07-21 23:39:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:36,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:36,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:36,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:36,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 23:39:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:36,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 23:39:36,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:36,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:39:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:36,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:36,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:36,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530167931] [2022-07-21 23:39:36,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530167931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:36,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:36,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112576402] [2022-07-21 23:39:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:36,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:36,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:36,852 INFO L87 Difference]: Start difference. First operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:37,333 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2022-07-21 23:39:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:37,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 23:39:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:37,342 INFO L225 Difference]: With dead ends: 253 [2022-07-21 23:39:37,343 INFO L226 Difference]: Without dead ends: 251 [2022-07-21 23:39:37,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:37,347 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 241 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:37,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-21 23:39:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2022-07-21 23:39:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2022-07-21 23:39:37,389 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 3 [2022-07-21 23:39:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:37,389 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2022-07-21 23:39:37,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2022-07-21 23:39:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-21 23:39:37,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:37,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-21 23:39:37,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 23:39:37,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:37,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2022-07-21 23:39:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:37,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290441897] [2022-07-21 23:39:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:37,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:37,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 23:39:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:37,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:39:37,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:37,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:39:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:37,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:37,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:37,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290441897] [2022-07-21 23:39:37,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290441897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:37,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:37,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268599402] [2022-07-21 23:39:37,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:37,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:37,780 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:38,418 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2022-07-21 23:39:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:38,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-21 23:39:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:38,421 INFO L225 Difference]: With dead ends: 234 [2022-07-21 23:39:38,422 INFO L226 Difference]: Without dead ends: 234 [2022-07-21 23:39:38,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:38,423 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:38,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 430 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 23:39:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-21 23:39:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-07-21 23:39:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2022-07-21 23:39:38,435 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 3 [2022-07-21 23:39:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:38,435 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2022-07-21 23:39:38,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-07-21 23:39:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 23:39:38,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:38,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 23:39:38,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:38,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:38,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2022-07-21 23:39:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:38,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115804069] [2022-07-21 23:39:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:38,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:38,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 23:39:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:38,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:38,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:38,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:39:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:38,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:38,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:38,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115804069] [2022-07-21 23:39:38,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115804069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:38,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:38,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:39:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975460502] [2022-07-21 23:39:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:38,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:39:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:39:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:38,828 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:39,427 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2022-07-21 23:39:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:39:39,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 23:39:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:39,430 INFO L225 Difference]: With dead ends: 238 [2022-07-21 23:39:39,430 INFO L226 Difference]: Without dead ends: 238 [2022-07-21 23:39:39,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:39,431 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:39,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 431 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 23:39:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-21 23:39:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2022-07-21 23:39:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2022-07-21 23:39:39,444 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 6 [2022-07-21 23:39:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:39,445 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2022-07-21 23:39:39,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2022-07-21 23:39:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 23:39:39,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:39,446 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:39,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-21 23:39:39,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:39,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:39,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2080656212, now seen corresponding path program 1 times [2022-07-21 23:39:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:39,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30869624] [2022-07-21 23:39:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:39,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:39,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:39,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:39,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 23:39:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:39,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 23:39:39,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:39,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:39:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:39,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:40,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:40,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30869624] [2022-07-21 23:39:40,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30869624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:39:40,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:39:40,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-21 23:39:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299925658] [2022-07-21 23:39:40,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:39:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 23:39:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 23:39:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 23:39:40,840 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:44,122 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2022-07-21 23:39:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 23:39:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-21 23:39:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:44,124 INFO L225 Difference]: With dead ends: 242 [2022-07-21 23:39:44,124 INFO L226 Difference]: Without dead ends: 242 [2022-07-21 23:39:44,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:39:44,125 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 31 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:44,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1116 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-21 23:39:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-21 23:39:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-21 23:39:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2022-07-21 23:39:44,134 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 10 [2022-07-21 23:39:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:44,135 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2022-07-21 23:39:44,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2022-07-21 23:39:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 23:39:44,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:44,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:44,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:44,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:44,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1026813049, now seen corresponding path program 1 times [2022-07-21 23:39:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:44,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881613277] [2022-07-21 23:39:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:44,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:44,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:44,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:44,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 23:39:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:44,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:44,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:44,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:44,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:44,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881613277] [2022-07-21 23:39:44,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881613277] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:39:44,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:39:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 23:39:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125774355] [2022-07-21 23:39:44,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:39:44,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 23:39:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 23:39:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:39:44,599 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:44,757 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2022-07-21 23:39:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 23:39:44,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 19 [2022-07-21 23:39:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:44,759 INFO L225 Difference]: With dead ends: 262 [2022-07-21 23:39:44,759 INFO L226 Difference]: Without dead ends: 262 [2022-07-21 23:39:44,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-21 23:39:44,760 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 24 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:44,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1835 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 23:39:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-21 23:39:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-21 23:39:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2022-07-21 23:39:44,769 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 19 [2022-07-21 23:39:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:44,769 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2022-07-21 23:39:44,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2022-07-21 23:39:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 23:39:44,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:44,771 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:44,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-21 23:39:44,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:44,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098840, now seen corresponding path program 2 times [2022-07-21 23:39:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:44,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438859079] [2022-07-21 23:39:44,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 23:39:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:44,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:44,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 23:39:45,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 23:39:45,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:39:45,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:45,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:45,167 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 23:39:45,168 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-21 23:39:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-21 23:39:45,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:45,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:45,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438859079] [2022-07-21 23:39:45,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438859079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:45,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:45,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-21 23:39:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659132025] [2022-07-21 23:39:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:45,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:45,321 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 23:39:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:45,641 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2022-07-21 23:39:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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 39 [2022-07-21 23:39:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:45,643 INFO L225 Difference]: With dead ends: 277 [2022-07-21 23:39:45,643 INFO L226 Difference]: Without dead ends: 277 [2022-07-21 23:39:45,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:45,644 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 237 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:45,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 23:39:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-21 23:39:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2022-07-21 23:39:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 294 transitions. [2022-07-21 23:39:45,651 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 294 transitions. Word has length 39 [2022-07-21 23:39:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:45,651 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 294 transitions. [2022-07-21 23:39:45,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-21 23:39:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2022-07-21 23:39:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-21 23:39:45,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:45,653 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:45,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-21 23:39:45,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:45,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:45,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098841, now seen corresponding path program 1 times [2022-07-21 23:39:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:45,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631563425] [2022-07-21 23:39:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:45,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:45,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:45,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 23:39:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:46,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 23:39:46,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:46,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:39:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 23:39:46,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:46,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631563425] [2022-07-21 23:39:46,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631563425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:39:46,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:39:46,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-21 23:39:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057338941] [2022-07-21 23:39:46,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:39:46,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 23:39:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 23:39:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-21 23:39:46,389 INFO L87 Difference]: Start difference. First operand 261 states and 294 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:46,771 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2022-07-21 23:39:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 23:39:46,772 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 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 39 [2022-07-21 23:39:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:46,773 INFO L225 Difference]: With dead ends: 269 [2022-07-21 23:39:46,773 INFO L226 Difference]: Without dead ends: 269 [2022-07-21 23:39:46,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-21 23:39:46,774 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 30 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:46,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3441 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-21 23:39:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-21 23:39:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 302 transitions. [2022-07-21 23:39:46,780 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 302 transitions. Word has length 39 [2022-07-21 23:39:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:46,781 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 302 transitions. [2022-07-21 23:39:46,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 23:39:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2022-07-21 23:39:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 23:39:46,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:46,782 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:46,800 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-21 23:39:46,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:46,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 233252627, now seen corresponding path program 2 times [2022-07-21 23:39:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:46,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976072795] [2022-07-21 23:39:46,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 23:39:46,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:46,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:47,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:47,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 23:39:47,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 23:39:47,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 23:39:47,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 23:39:47,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:47,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 23:39:47,196 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-21 23:39:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:47,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:47,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:47,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976072795] [2022-07-21 23:39:47,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976072795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:47,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:47,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:47,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757088170] [2022-07-21 23:39:47,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:47,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:39:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:47,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:39:47,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:47,476 INFO L87 Difference]: Start difference. First operand 269 states and 302 transitions. Second operand has 4 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-21 23:39:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:47,983 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2022-07-21 23:39:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:39:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 47 [2022-07-21 23:39:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:47,985 INFO L225 Difference]: With dead ends: 284 [2022-07-21 23:39:47,985 INFO L226 Difference]: Without dead ends: 284 [2022-07-21 23:39:47,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:47,986 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 275 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:47,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 158 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 23:39:47,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-21 23:39:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-07-21 23:39:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2022-07-21 23:39:47,991 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2022-07-21 23:39:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:47,992 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2022-07-21 23:39:47,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-21 23:39:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2022-07-21 23:39:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 23:39:47,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:47,994 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:48,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:48,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:48,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773764, now seen corresponding path program 1 times [2022-07-21 23:39:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237129050] [2022-07-21 23:39:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:48,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:48,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:48,209 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:48,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 23:39:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:48,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:39:48,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:48,578 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 23:39:48,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-21 23:39:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:48,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:48,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:48,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237129050] [2022-07-21 23:39:48,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237129050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:48,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:48,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 23:39:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354632043] [2022-07-21 23:39:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:48,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 23:39:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 23:39:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:48,605 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:48,969 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-07-21 23:39:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 23:39:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 55 [2022-07-21 23:39:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:48,971 INFO L225 Difference]: With dead ends: 279 [2022-07-21 23:39:48,971 INFO L226 Difference]: Without dead ends: 279 [2022-07-21 23:39:48,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 23:39:48,972 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 222 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:48,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 211 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-21 23:39:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-07-21 23:39:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2022-07-21 23:39:48,978 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 55 [2022-07-21 23:39:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:48,979 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2022-07-21 23:39:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-07-21 23:39:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 23:39:48,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:48,980 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:49,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:49,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773765, now seen corresponding path program 1 times [2022-07-21 23:39:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:49,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662030276] [2022-07-21 23:39:49,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:49,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:49,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:49,206 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:49,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 23:39:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:49,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 23:39:49,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:49,633 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 23:39:49,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:49,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:49,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:49,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662030276] [2022-07-21 23:39:49,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662030276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:49,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:49,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 23:39:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786207292] [2022-07-21 23:39:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:49,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 23:39:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 23:39:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 23:39:49,723 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:51,019 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2022-07-21 23:39:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 23:39:51,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 55 [2022-07-21 23:39:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:51,022 INFO L225 Difference]: With dead ends: 443 [2022-07-21 23:39:51,022 INFO L226 Difference]: Without dead ends: 443 [2022-07-21 23:39:51,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:39:51,023 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 642 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:51,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 778 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-21 23:39:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-21 23:39:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 367. [2022-07-21 23:39:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 23:39:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2022-07-21 23:39:51,030 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 55 [2022-07-21 23:39:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:51,031 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2022-07-21 23:39:51,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2022-07-21 23:39:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 23:39:51,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:51,033 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:51,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:51,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:51,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2067963466, now seen corresponding path program 1 times [2022-07-21 23:39:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:51,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623665471] [2022-07-21 23:39:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:51,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:51,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:51,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:51,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 23:39:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:51,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 23:39:51,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:51,816 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-21 23:39:51,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:52,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 23:39:52,161 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-21 23:39:52,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2022-07-21 23:39:52,179 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:39:52,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:39:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:52,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:52,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623665471] [2022-07-21 23:39:52,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623665471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:52,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 23:39:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928675846] [2022-07-21 23:39:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:52,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 23:39:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:52,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 23:39:52,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-21 23:39:52,312 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:52,402 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2022-07-21 23:39:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:39:52,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-21 23:39:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:52,404 INFO L225 Difference]: With dead ends: 368 [2022-07-21 23:39:52,404 INFO L226 Difference]: Without dead ends: 368 [2022-07-21 23:39:52,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-21 23:39:52,405 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:52,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1444 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 305 Unchecked, 0.0s Time] [2022-07-21 23:39:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-21 23:39:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-07-21 23:39:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 23:39:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 496 transitions. [2022-07-21 23:39:52,420 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 496 transitions. Word has length 58 [2022-07-21 23:39:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:52,421 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 496 transitions. [2022-07-21 23:39:52,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2022-07-21 23:39:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 23:39:52,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:52,426 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:52,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:52,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:52,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -317642580, now seen corresponding path program 1 times [2022-07-21 23:39:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:52,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143930055] [2022-07-21 23:39:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:52,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:52,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:52,629 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:52,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 23:39:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:52,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 23:39:52,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:52,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:52,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:52,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143930055] [2022-07-21 23:39:52,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143930055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:52,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:52,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 23:39:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846106480] [2022-07-21 23:39:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:52,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 23:39:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 23:39:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 23:39:52,959 INFO L87 Difference]: Start difference. First operand 368 states and 496 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:53,216 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-07-21 23:39:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 23:39:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-07-21 23:39:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:53,218 INFO L225 Difference]: With dead ends: 286 [2022-07-21 23:39:53,218 INFO L226 Difference]: Without dead ends: 286 [2022-07-21 23:39:53,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:39:53,219 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 263 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:53,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 952 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 23:39:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-21 23:39:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2022-07-21 23:39:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 297 transitions. [2022-07-21 23:39:53,224 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 297 transitions. Word has length 59 [2022-07-21 23:39:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:53,224 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 297 transitions. [2022-07-21 23:39:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 297 transitions. [2022-07-21 23:39:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 23:39:53,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:53,225 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:53,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:53,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:53,426 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1256967413, now seen corresponding path program 1 times [2022-07-21 23:39:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:53,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090149919] [2022-07-21 23:39:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:53,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:53,429 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:53,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 23:39:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:53,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 23:39:53,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:53,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:53,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090149919] [2022-07-21 23:39:53,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090149919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:53,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:53,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 23:39:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044217790] [2022-07-21 23:39:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:53,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 23:39:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 23:39:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:39:53,726 INFO L87 Difference]: Start difference. First operand 264 states and 297 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:54,496 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2022-07-21 23:39:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 23:39:54,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 60 [2022-07-21 23:39:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:54,499 INFO L225 Difference]: With dead ends: 282 [2022-07-21 23:39:54,499 INFO L226 Difference]: Without dead ends: 282 [2022-07-21 23:39:54,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 23:39:54,500 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 277 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:54,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 631 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 23:39:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-21 23:39:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-07-21 23:39:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2022-07-21 23:39:54,506 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 60 [2022-07-21 23:39:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:54,506 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2022-07-21 23:39:54,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2022-07-21 23:39:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 23:39:54,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:54,507 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:54,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-21 23:39:54,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:54,722 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:54,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash -311284142, now seen corresponding path program 1 times [2022-07-21 23:39:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:54,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059517934] [2022-07-21 23:39:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:54,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:54,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 23:39:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:55,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 23:39:55,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:55,126 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 23:39:55,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-21 23:39:55,151 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-21 23:39:55,151 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 14 treesize of output 19 [2022-07-21 23:39:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:55,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:55,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:55,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059517934] [2022-07-21 23:39:55,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059517934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:55,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:55,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 23:39:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129027081] [2022-07-21 23:39:55,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 23:39:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 23:39:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:55,185 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:55,615 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2022-07-21 23:39:55,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 23:39:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 61 [2022-07-21 23:39:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:55,616 INFO L225 Difference]: With dead ends: 282 [2022-07-21 23:39:55,616 INFO L226 Difference]: Without dead ends: 282 [2022-07-21 23:39:55,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 23:39:55,617 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 214 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:55,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 373 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 23:39:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-21 23:39:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2022-07-21 23:39:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2022-07-21 23:39:55,622 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 61 [2022-07-21 23:39:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:55,622 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2022-07-21 23:39:55,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-07-21 23:39:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 23:39:55,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:55,624 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:55,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:55,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:55,824 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash -311284141, now seen corresponding path program 1 times [2022-07-21 23:39:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864692607] [2022-07-21 23:39:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:55,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:55,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:55,827 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:55,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 23:39:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:56,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 23:39:56,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:56,423 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-21 23:39:56,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 23:39:56,444 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-21 23:39:56,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-21 23:39:56,598 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:39:56,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:39:56,607 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 17 treesize of output 19 [2022-07-21 23:39:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:56,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:56,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:56,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864692607] [2022-07-21 23:39:56,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864692607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:56,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:56,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 23:39:56,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224999622] [2022-07-21 23:39:56,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:56,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 23:39:56,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:56,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 23:39:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 23:39:56,785 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:56,878 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2022-07-21 23:39:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 23:39:56,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 61 [2022-07-21 23:39:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:56,879 INFO L225 Difference]: With dead ends: 279 [2022-07-21 23:39:56,880 INFO L226 Difference]: Without dead ends: 279 [2022-07-21 23:39:56,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 23:39:56,880 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 4 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:56,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1426 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 303 Unchecked, 0.0s Time] [2022-07-21 23:39:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-21 23:39:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-07-21 23:39:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.601010101010101) internal successors, (317), 275 states have internal predecessors, (317), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 321 transitions. [2022-07-21 23:39:56,886 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 321 transitions. Word has length 61 [2022-07-21 23:39:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:56,886 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 321 transitions. [2022-07-21 23:39:56,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 321 transitions. [2022-07-21 23:39:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 23:39:56,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:56,887 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:56,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:57,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:57,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:57,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash -631451440, now seen corresponding path program 1 times [2022-07-21 23:39:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:57,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973288111] [2022-07-21 23:39:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:57,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:57,089 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:57,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-21 23:39:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:57,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 23:39:57,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:57,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:39:57,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:39:57,684 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-21 23:39:57,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-07-21 23:39:57,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2022-07-21 23:39:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:57,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:57,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973288111] [2022-07-21 23:39:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973288111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:57,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:57,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 23:39:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016616221] [2022-07-21 23:39:57,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:57,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 23:39:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 23:39:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-21 23:39:57,782 INFO L87 Difference]: Start difference. First operand 279 states and 321 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:39:58,964 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2022-07-21 23:39:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:39:58,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 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 64 [2022-07-21 23:39:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:39:58,965 INFO L225 Difference]: With dead ends: 277 [2022-07-21 23:39:58,966 INFO L226 Difference]: Without dead ends: 277 [2022-07-21 23:39:58,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-21 23:39:58,966 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 232 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:39:58,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1042 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 23:39:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-21 23:39:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-07-21 23:39:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 273 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:39:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2022-07-21 23:39:58,971 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 64 [2022-07-21 23:39:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:39:58,971 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2022-07-21 23:39:58,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:39:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2022-07-21 23:39:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 23:39:58,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:39:58,972 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:39:58,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-21 23:39:59,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:39:59,173 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:39:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:39:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -631451439, now seen corresponding path program 1 times [2022-07-21 23:39:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:39:59,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118378258] [2022-07-21 23:39:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:39:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:39:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:39:59,175 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:39:59,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 23:39:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:39:59,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 23:39:59,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:39:59,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:39:59,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:39:59,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:39:59,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:39:59,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-21 23:39:59,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:39:59,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-21 23:39:59,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2022-07-21 23:39:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:39:59,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:39:59,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:39:59,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118378258] [2022-07-21 23:39:59,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118378258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:39:59,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:39:59,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 23:39:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777871391] [2022-07-21 23:39:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:39:59,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 23:39:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:39:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 23:39:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 23:39:59,858 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:40:00,812 INFO L93 Difference]: Finished difference Result 276 states and 315 transitions. [2022-07-21 23:40:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 23:40:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 64 [2022-07-21 23:40:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:40:00,813 INFO L225 Difference]: With dead ends: 276 [2022-07-21 23:40:00,813 INFO L226 Difference]: Without dead ends: 276 [2022-07-21 23:40:00,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:40:00,814 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 240 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 23:40:00,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 734 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 23:40:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-21 23:40:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-07-21 23:40:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 198 states have (on average 1.5707070707070707) internal successors, (311), 272 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:40:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2022-07-21 23:40:00,819 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 64 [2022-07-21 23:40:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:40:00,820 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2022-07-21 23:40:00,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2022-07-21 23:40:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 23:40:00,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:40:00,821 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:40:00,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-21 23:40:01,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:40:01,040 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:40:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:40:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -889593477, now seen corresponding path program 1 times [2022-07-21 23:40:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:40:01,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252383789] [2022-07-21 23:40:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:40:01,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:40:01,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:40:01,042 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:40:01,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-21 23:40:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:40:01,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 23:40:01,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:40:01,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:40:01,698 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:40:01,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 23:40:01,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:01,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 23:40:01,950 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:01,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-21 23:40:01,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:40:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:40:02,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:40:02,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:40:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252383789] [2022-07-21 23:40:02,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252383789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:40:02,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:40:02,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 23:40:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480738288] [2022-07-21 23:40:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:40:02,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 23:40:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:40:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 23:40:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-21 23:40:02,054 INFO L87 Difference]: Start difference. First operand 276 states and 315 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:40:02,988 INFO L93 Difference]: Finished difference Result 297 states and 337 transitions. [2022-07-21 23:40:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 23:40:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 68 [2022-07-21 23:40:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:40:02,989 INFO L225 Difference]: With dead ends: 297 [2022-07-21 23:40:02,990 INFO L226 Difference]: Without dead ends: 297 [2022-07-21 23:40:02,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-21 23:40:02,990 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 493 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 23:40:02,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 649 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 107 Unchecked, 0.8s Time] [2022-07-21 23:40:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-21 23:40:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2022-07-21 23:40:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 281 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:40:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 330 transitions. [2022-07-21 23:40:02,996 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 330 transitions. Word has length 68 [2022-07-21 23:40:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:40:02,996 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 330 transitions. [2022-07-21 23:40:02,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 330 transitions. [2022-07-21 23:40:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 23:40:02,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:40:02,997 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:40:03,019 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-21 23:40:03,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:40:03,198 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:40:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:40:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -889593476, now seen corresponding path program 1 times [2022-07-21 23:40:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:40:03,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507275119] [2022-07-21 23:40:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:40:03,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:40:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:40:03,201 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:40:03,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 23:40:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:40:03,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 23:40:03,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:40:03,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:40:03,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:40:03,819 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:40:03,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:40:03,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:03,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:03,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 23:40:03,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:40:04,121 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:04,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-21 23:40:04,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 23:40:04,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:40:04,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-21 23:40:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-21 23:40:04,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 23:40:04,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:40:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507275119] [2022-07-21 23:40:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507275119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 23:40:04,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 23:40:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 23:40:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396180447] [2022-07-21 23:40:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 23:40:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 23:40:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:40:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 23:40:04,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 23:40:04,263 INFO L87 Difference]: Start difference. First operand 285 states and 330 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:40:05,865 INFO L93 Difference]: Finished difference Result 297 states and 334 transitions. [2022-07-21 23:40:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 23:40:05,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 68 [2022-07-21 23:40:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:40:05,866 INFO L225 Difference]: With dead ends: 297 [2022-07-21 23:40:05,866 INFO L226 Difference]: Without dead ends: 297 [2022-07-21 23:40:05,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-21 23:40:05,867 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 482 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 23:40:05,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 669 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 23:40:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-21 23:40:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2022-07-21 23:40:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5555555555555556) internal successors, (322), 281 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:40:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2022-07-21 23:40:05,873 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 68 [2022-07-21 23:40:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:40:05,873 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2022-07-21 23:40:05,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2022-07-21 23:40:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 23:40:05,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:40:05,874 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:40:05,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 23:40:06,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:40:06,093 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:40:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:40:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -269261804, now seen corresponding path program 1 times [2022-07-21 23:40:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:40:06,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568974401] [2022-07-21 23:40:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:40:06,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:40:06,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:40:06,095 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 23:40:06,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 23:40:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:40:06,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 23:40:06,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:40:06,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:40:06,793 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 23:40:06,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 23:40:06,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:06,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 23:40:06,973 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:06,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-21 23:40:07,058 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:07,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-21 23:40:07,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:40:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-21 23:40:07,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:40:07,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1548) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-21 23:40:07,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-21 23:40:07,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-21 23:40:07,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1546))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))) is different from false [2022-07-21 23:40:07,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 23:40:07,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2022-07-21 23:40:07,508 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 2665 treesize of output 1963 [2022-07-21 23:40:07,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1959 treesize of output 1644 [2022-07-21 23:40:07,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1644 treesize of output 1294 [2022-07-21 23:40:07,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1294 treesize of output 1266 [2022-07-21 23:40:16,279 INFO L356 Elim1Store]: treesize reduction -11, result has 113.6 percent of original size [2022-07-21 23:40:16,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 219 [2022-07-21 23:40:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2022-07-21 23:40:17,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:40:17,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568974401] [2022-07-21 23:40:17,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568974401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 23:40:17,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 23:40:17,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-21 23:40:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403877541] [2022-07-21 23:40:17,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 23:40:17,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-21 23:40:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 23:40:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-21 23:40:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=164, Unknown=7, NotChecked=116, Total=342 [2022-07-21 23:40:17,218 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 23:40:18,732 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2022-07-21 23:40:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 23:40:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 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 73 [2022-07-21 23:40:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 23:40:18,734 INFO L225 Difference]: With dead ends: 287 [2022-07-21 23:40:18,734 INFO L226 Difference]: Without dead ends: 287 [2022-07-21 23:40:18,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=7, NotChecked=132, Total=420 [2022-07-21 23:40:18,735 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 20 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 802 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 23:40:18,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2318 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 802 Unchecked, 1.1s Time] [2022-07-21 23:40:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-21 23:40:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-07-21 23:40:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5507246376811594) internal successors, (321), 281 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 23:40:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2022-07-21 23:40:18,740 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 73 [2022-07-21 23:40:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 23:40:18,740 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2022-07-21 23:40:18,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 23:40:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2022-07-21 23:40:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 23:40:18,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 23:40:18,741 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 23:40:18,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 23:40:18,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:40:18,963 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-21 23:40:18,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 23:40:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash -269261803, now seen corresponding path program 1 times [2022-07-21 23:40:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 23:40:18,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404063472] [2022-07-21 23:40:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 23:40:18,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 23:40:18,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 23:40:18,965 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-21 23:40:18,966 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-21 23:40:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 23:40:19,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 23:40:19,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 23:40:19,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-21 23:40:19,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 23:40:19,732 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 23:40:19,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 23:40:19,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:19,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 23:40:19,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-21 23:40:19,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-21 23:40:19,944 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:19,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-21 23:40:19,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 23:40:20,105 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 23:40:20,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 58 treesize of output 57 [2022-07-21 23:40:20,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-21 23:40:20,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-21 23:40:20,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-21 23:40:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-21 23:40:20,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 23:40:21,176 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2022-07-21 23:40:21,273 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse2 .cse3) (bvadd (_ bv1 64) .cse2 .cse3))))) is different from false [2022-07-21 23:40:21,377 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2022-07-21 23:40:21,442 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse4 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64)))))) is different from false [2022-07-21 23:40:21,766 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1678))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1679) .cse1 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1680)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-21 23:40:22,069 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse2 v_ArrVal_1679) (select (select (store .cse3 .cse2 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1678))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse5 v_ArrVal_1679) .cse6 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) (_ bv1 64)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2022-07-21 23:40:22,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 23:40:22,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2022-07-21 23:40:22,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 23:40:22,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2022-07-21 23:40:22,195 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 5607 treesize of output 4554 [2022-07-21 23:40:22,248 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 92771 treesize of output 89882 [2022-07-21 23:40:22,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89878 treesize of output 81366 [2022-07-21 23:40:22,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81366 treesize of output 79126 [2022-07-21 23:40:22,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79126 treesize of output 75094 [2022-07-21 23:40:23,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75094 treesize of output 64426 [2022-07-21 23:40:23,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64426 treesize of output 55914 [2022-07-21 23:40:23,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55914 treesize of output 46842 [2022-07-21 23:40:25,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 23:40:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404063472] [2022-07-21 23:40:25,625 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 23:40:25,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-21 23:40:25,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 23:40:25,826 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:409) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:354) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDistributivityAndPush(QuantifierPusher.java:409) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:354) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 23:40:25,830 INFO L158 Benchmark]: Toolchain (without parser) took 51809.03ms. Allocated memory was 52.4MB in the beginning and 394.3MB in the end (delta: 341.8MB). Free memory was 26.4MB in the beginning and 207.2MB in the end (delta: -180.8MB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. [2022-07-21 23:40:25,830 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 23:40:25,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.10ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 26.1MB in the beginning and 42.2MB in the end (delta: -16.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-07-21 23:40:25,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.21ms. Allocated memory is still 67.1MB. Free memory was 42.2MB in the beginning and 37.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 23:40:25,831 INFO L158 Benchmark]: Boogie Preprocessor took 73.96ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 33.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 23:40:25,831 INFO L158 Benchmark]: RCFGBuilder took 1439.42ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.1MB in the beginning and 50.9MB in the end (delta: -17.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-07-21 23:40:25,832 INFO L158 Benchmark]: TraceAbstraction took 49365.94ms. Allocated memory was 81.8MB in the beginning and 394.3MB in the end (delta: 312.5MB). Free memory was 50.5MB in the beginning and 207.2MB in the end (delta: -156.7MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. [2022-07-21 23:40:25,833 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory is still 33.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.10ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 26.1MB in the beginning and 42.2MB in the end (delta: -16.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.21ms. Allocated memory is still 67.1MB. Free memory was 42.2MB in the beginning and 37.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.96ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 33.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1439.42ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.1MB in the beginning and 50.9MB in the end (delta: -17.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 49365.94ms. Allocated memory was 81.8MB in the beginning and 394.3MB in the end (delta: 312.5MB). Free memory was 50.5MB in the beginning and 207.2MB in the end (delta: -156.7MB). Peak memory consumption was 239.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 23:40:25,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range