./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:34:55,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:34:55,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:34:55,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:34:55,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:34:55,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:34:55,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:34:55,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:34:55,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:34:55,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:34:55,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:34:55,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:34:55,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:34:55,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:34:55,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:34:55,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:34:55,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:34:55,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:34:55,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:34:55,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:34:55,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:34:55,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:34:55,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:34:55,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:34:55,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:34:55,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:34:55,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:34:55,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:34:55,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:34:55,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:34:55,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:34:55,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:34:55,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:34:55,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:34:55,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:34:55,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:34:55,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:34:55,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:34:55,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:34:55,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:34:55,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:34:55,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-02-15 22:34:55,106 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:34:55,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:34:55,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:34:55,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:34:55,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:34:55,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:34:55,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:34:55,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:34:55,109 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:34:55,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:34:55,109 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:34:55,110 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:34:55,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:34:55,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:34:55,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:34:55,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:55,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:34:55,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:34:55,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:34:55,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:34:55,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:34:55,112 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:34:55,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:34:55,112 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:34:55,112 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2023-02-15 22:34:55,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:34:55,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:34:55,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:34:55,317 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:34:55,318 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:34:55,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 22:34:56,240 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:34:56,518 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:34:56,522 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 22:34:56,536 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4e525a8/85f35175b5db417f9878fdec4c7df64a/FLAG5d1a899db [2023-02-15 22:34:56,546 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4e525a8/85f35175b5db417f9878fdec4c7df64a [2023-02-15 22:34:56,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:34:56,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:34:56,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:56,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:34:56,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:34:56,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:56" (1/1) ... [2023-02-15 22:34:56,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548e8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:56, skipping insertion in model container [2023-02-15 22:34:56,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:56" (1/1) ... [2023-02-15 22:34:56,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:34:56,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:56,973 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 22:34:56,974 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 22:34:56,977 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 22:34:57,013 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:34:57,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:57,031 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) [2023-02-15 22:34:57,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@13dee3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:57, skipping insertion in model container [2023-02-15 22:34:57,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:57,032 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:34:57,033 INFO L158 Benchmark]: Toolchain (without parser) took 483.11ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 69.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 22:34:57,033 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:34:57,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.30ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 69.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 22:34:57,035 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.12ms. Allocated memory is still 96.5MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.30ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 69.6MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1162]: 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/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:34:58,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:34:58,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:34:58,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:34:58,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:34:58,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:34:58,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:34:58,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:34:58,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:34:58,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:34:58,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:34:58,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:34:58,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:34:58,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:34:58,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:34:58,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:34:58,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:34:58,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:34:58,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:34:58,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:34:58,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:34:58,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:34:58,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:34:58,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:34:58,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:34:58,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:34:58,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:34:58,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:34:58,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:34:58,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:34:58,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:34:58,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:34:58,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:34:58,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:34:58,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:34:58,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:34:58,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:34:58,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:34:58,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:34:58,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:34:58,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:34:58,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-02-15 22:34:58,713 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:34:58,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:34:58,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:34:58,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:34:58,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:34:58,715 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:34:58,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:34:58,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:34:58,716 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:34:58,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:34:58,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:34:58,718 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:34:58,718 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:34:58,718 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:34:58,718 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:34:58,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:34:58,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:34:58,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:34:58,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:58,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:34:58,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:34:58,719 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:34:58,719 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:34:58,719 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:34:58,719 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:34:58,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:34:58,720 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:34:58,720 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:34:58,720 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2023-02-15 22:34:59,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:34:59,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:34:59,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:34:59,019 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:34:59,019 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:34:59,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 22:35:00,105 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:35:00,373 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:35:00,374 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-02-15 22:35:00,386 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f857e4279/47607c82af6449e283e4e53958972e6b/FLAGeb7278cbe [2023-02-15 22:35:00,401 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f857e4279/47607c82af6449e283e4e53958972e6b [2023-02-15 22:35:00,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:35:00,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:35:00,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:35:00,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:35:00,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:35:00,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:35:00" (1/1) ... [2023-02-15 22:35:00,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1882f4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:00, skipping insertion in model container [2023-02-15 22:35:00,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:35:00" (1/1) ... [2023-02-15 22:35:00,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:35:00,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:35:00,878 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 22:35:00,879 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 22:35:00,880 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 22:35:00,921 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:35:00,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:35:00,939 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:35:00,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:35:00,966 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 22:35:00,966 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 22:35:00,967 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 22:35:00,991 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:35:01,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:35:01,018 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:35:01,051 WARN L623 FunctionHandler]: Unknown extern function dirname [2023-02-15 22:35:01,057 WARN L623 FunctionHandler]: Unknown extern function puts [2023-02-15 22:35:01,057 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-15 22:35:01,067 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:35:01,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:35:01,148 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:35:01,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01 WrapperNode [2023-02-15 22:35:01,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:35:01,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:35:01,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:35:01,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:35:01,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,232 INFO L138 Inliner]: procedures = 350, calls = 111, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 257 [2023-02-15 22:35:01,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:35:01,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:35:01,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:35:01,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:35:01,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:35:01,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:35:01,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:35:01,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:35:01,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (1/1) ... [2023-02-15 22:35:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:35:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:35:01,316 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) [2023-02-15 22:35:01,323 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 [2023-02-15 22:35:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-15 22:35:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 22:35:01,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 22:35:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:35:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-15 22:35:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:35:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:35:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2023-02-15 22:35:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:35:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-02-15 22:35:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:35:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:35:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:35:01,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:35:01,528 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:35:01,532 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:35:02,323 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:35:02,327 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:35:02,327 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-15 22:35:02,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:35:02 BoogieIcfgContainer [2023-02-15 22:35:02,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:35:02,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:35:02,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:35:02,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:35:02,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:35:00" (1/3) ... [2023-02-15 22:35:02,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfa3a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:35:02, skipping insertion in model container [2023-02-15 22:35:02,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:35:01" (2/3) ... [2023-02-15 22:35:02,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfa3a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:35:02, skipping insertion in model container [2023-02-15 22:35:02,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:35:02" (3/3) ... [2023-02-15 22:35:02,339 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2023-02-15 22:35:02,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:35:02,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2023-02-15 22:35:02,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:35:02,382 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2afd202a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:35:02,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2023-02-15 22:35:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 102 states have (on average 1.9509803921568627) internal successors, (199), 175 states have internal predecessors, (199), 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) [2023-02-15 22:35:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:35:02,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:02,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:35:02,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 22:35:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:02,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015110732] [2023-02-15 22:35:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:02,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:02,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:35:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:02,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:35:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:02,560 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:35:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:02,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:02,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:02,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015110732] [2023-02-15 22:35:02,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015110732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:02,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:02,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263940152] [2023-02-15 22:35:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:02,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:02,599 INFO L87 Difference]: Start difference. First operand has 178 states, 102 states have (on average 1.9509803921568627) internal successors, (199), 175 states have internal predecessors, (199), 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) 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) [2023-02-15 22:35:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:02,914 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2023-02-15 22:35:02,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:02,916 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 [2023-02-15 22:35:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:02,922 INFO L225 Difference]: With dead ends: 188 [2023-02-15 22:35:02,922 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 22:35:02,923 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 [2023-02-15 22:35:02,927 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 160 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:02,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 144 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:35:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 22:35:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-02-15 22:35:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 99 states have (on average 1.8484848484848484) internal successors, (183), 167 states have internal predecessors, (183), 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) [2023-02-15 22:35:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2023-02-15 22:35:02,961 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 3 [2023-02-15 22:35:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:02,962 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2023-02-15 22:35:02,962 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) [2023-02-15 22:35:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2023-02-15 22:35:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:35:02,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:02,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:35:02,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 22:35:03,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:03,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 22:35:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:03,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093999624] [2023-02-15 22:35:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:03,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:03,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:03,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:35:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:03,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:35:03,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:03,254 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:03,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:03,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093999624] [2023-02-15 22:35:03,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093999624] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:03,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:03,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640424019] [2023-02-15 22:35:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:03,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:03,275 INFO L87 Difference]: Start difference. First operand 170 states and 185 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) [2023-02-15 22:35:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:03,681 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2023-02-15 22:35:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:03,682 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 [2023-02-15 22:35:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:03,683 INFO L225 Difference]: With dead ends: 169 [2023-02-15 22:35:03,683 INFO L226 Difference]: Without dead ends: 169 [2023-02-15 22:35:03,683 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 [2023-02-15 22:35:03,684 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:03,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 288 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:35:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-15 22:35:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2023-02-15 22:35:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.8383838383838385) internal successors, (182), 166 states have internal predecessors, (182), 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) [2023-02-15 22:35:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2023-02-15 22:35:03,691 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 3 [2023-02-15 22:35:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:03,691 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2023-02-15 22:35:03,691 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) [2023-02-15 22:35:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2023-02-15 22:35:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:35:03,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:03,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:35:03,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-15 22:35:03,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:03,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-02-15 22:35:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:03,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428467469] [2023-02-15 22:35:03,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:03,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:03,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:03,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:03,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:35:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:03,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:35:03,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:03,981 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:04,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:04,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428467469] [2023-02-15 22:35:04,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428467469] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:04,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:04,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:35:04,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005287059] [2023-02-15 22:35:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:04,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:35:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:35:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:35:04,024 INFO L87 Difference]: Start difference. First operand 169 states and 184 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) [2023-02-15 22:35:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:04,505 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2023-02-15 22:35:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:35:04,505 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 [2023-02-15 22:35:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:04,506 INFO L225 Difference]: With dead ends: 173 [2023-02-15 22:35:04,506 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 22:35:04,506 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 [2023-02-15 22:35:04,507 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:04,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 396 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:35:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 22:35:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2023-02-15 22:35:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 101 states have (on average 1.8217821782178218) internal successors, (184), 168 states have internal predecessors, (184), 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) [2023-02-15 22:35:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2023-02-15 22:35:04,517 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 6 [2023-02-15 22:35:04,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:04,517 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2023-02-15 22:35:04,517 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) [2023-02-15 22:35:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2023-02-15 22:35:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:35:04,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:04,521 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:04,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:04,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:04,732 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-02-15 22:35:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:04,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601850887] [2023-02-15 22:35:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:04,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:04,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:04,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:35:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:04,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:35:04,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:04,801 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:04,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:05,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601850887] [2023-02-15 22:35:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601850887] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:05,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 22:35:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365284149] [2023-02-15 22:35:05,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:05,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:35:05,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:35:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:35:05,326 INFO L87 Difference]: Start difference. First operand 171 states and 186 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) [2023-02-15 22:35:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:07,306 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2023-02-15 22:35:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:35:07,308 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 [2023-02-15 22:35:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:07,311 INFO L225 Difference]: With dead ends: 177 [2023-02-15 22:35:07,311 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 22:35:07,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:35:07,313 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 14 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:07,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 724 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 22:35:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 22:35:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-15 22:35:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.7592592592592593) internal successors, (190), 174 states have internal predecessors, (190), 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) [2023-02-15 22:35:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2023-02-15 22:35:07,319 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 10 [2023-02-15 22:35:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:07,319 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2023-02-15 22:35:07,319 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) [2023-02-15 22:35:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2023-02-15 22:35:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:35:07,319 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:07,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:07,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:07,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:07,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:07,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1324461056, now seen corresponding path program 1 times [2023-02-15 22:35:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236974604] [2023-02-15 22:35:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:07,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:07,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:07,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:07,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:35:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:07,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:35:07,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:07,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:07,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:07,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236974604] [2023-02-15 22:35:07,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236974604] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:07,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:07,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:35:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428442948] [2023-02-15 22:35:07,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:07,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:35:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:35:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:35:07,744 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:35:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:07,905 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2023-02-15 22:35:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:35:07,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-15 22:35:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:07,907 INFO L225 Difference]: With dead ends: 197 [2023-02-15 22:35:07,907 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 22:35:07,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:07,908 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 18 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:07,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 902 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:35:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 22:35:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2023-02-15 22:35:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.640625) internal successors, (210), 194 states have internal predecessors, (210), 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) [2023-02-15 22:35:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2023-02-15 22:35:07,914 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 25 [2023-02-15 22:35:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:07,914 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2023-02-15 22:35:07,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:35:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2023-02-15 22:35:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:35:07,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:07,915 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:07,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:08,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:08,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash -536579439, now seen corresponding path program 2 times [2023-02-15 22:35:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:08,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680855621] [2023-02-15 22:35:08,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:35:08,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:08,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:08,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:35:08,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:35:08,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:35:08,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:35:08,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:08,241 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:35:08,241 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-15 22:35:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 22:35:08,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:08,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680855621] [2023-02-15 22:35:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680855621] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:08,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:08,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792630823] [2023-02-15 22:35:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:08,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:08,267 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:08,504 INFO L93 Difference]: Finished difference Result 208 states and 224 transitions. [2023-02-15 22:35:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:08,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-02-15 22:35:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:08,505 INFO L225 Difference]: With dead ends: 208 [2023-02-15 22:35:08,505 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 22:35:08,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:08,506 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 145 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:08,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 147 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:35:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 22:35:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2023-02-15 22:35:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.6015625) internal successors, (205), 189 states have internal predecessors, (205), 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) [2023-02-15 22:35:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2023-02-15 22:35:08,510 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 45 [2023-02-15 22:35:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:08,510 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2023-02-15 22:35:08,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2023-02-15 22:35:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:35:08,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:08,511 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:08,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:08,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:08,712 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -536579438, now seen corresponding path program 1 times [2023-02-15 22:35:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:08,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619184945] [2023-02-15 22:35:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:08,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:08,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:08,714 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:08,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:35:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:08,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:35:08,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:08,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:09,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619184945] [2023-02-15 22:35:09,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619184945] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:09,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:09,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 22:35:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924777688] [2023-02-15 22:35:09,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:09,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:35:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:35:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:35:09,132 INFO L87 Difference]: Start difference. First operand 192 states and 207 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:35:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:09,470 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2023-02-15 22:35:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:35:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-15 22:35:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:09,472 INFO L225 Difference]: With dead ends: 200 [2023-02-15 22:35:09,472 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 22:35:09,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:35:09,472 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 6 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:09,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2657 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:35:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 22:35:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-02-15 22:35:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.5661764705882353) internal successors, (213), 197 states have internal predecessors, (213), 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) [2023-02-15 22:35:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2023-02-15 22:35:09,477 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 45 [2023-02-15 22:35:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:09,477 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2023-02-15 22:35:09,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:35:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2023-02-15 22:35:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:35:09,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:09,478 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:09,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-15 22:35:09,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:09,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1584587084, now seen corresponding path program 2 times [2023-02-15 22:35:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:09,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127533441] [2023-02-15 22:35:09,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:35:09,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:09,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:09,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:35:09,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:35:09,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:35:09,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:35:09,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:09,873 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:35:09,873 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:09,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:09,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:09,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127533441] [2023-02-15 22:35:09,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127533441] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:09,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:09,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:35:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267262998] [2023-02-15 22:35:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:09,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:35:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:35:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:35:09,927 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:10,624 INFO L93 Difference]: Finished difference Result 319 states and 347 transitions. [2023-02-15 22:35:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:35:10,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-15 22:35:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:10,626 INFO L225 Difference]: With dead ends: 319 [2023-02-15 22:35:10,626 INFO L226 Difference]: Without dead ends: 319 [2023-02-15 22:35:10,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:35:10,627 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 430 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:10,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 475 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:35:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-15 22:35:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2023-02-15 22:35:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 200 states have (on average 1.67) internal successors, (334), 260 states have internal predecessors, (334), 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) [2023-02-15 22:35:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 336 transitions. [2023-02-15 22:35:10,631 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 336 transitions. Word has length 53 [2023-02-15 22:35:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:10,631 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 336 transitions. [2023-02-15 22:35:10,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 336 transitions. [2023-02-15 22:35:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:35:10,632 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:10,632 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] [2023-02-15 22:35:10,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:10,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:10,840 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash 448239575, now seen corresponding path program 1 times [2023-02-15 22:35:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:10,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014692123] [2023-02-15 22:35:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:10,842 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:10,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:35:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:11,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:35:11,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:11,237 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:35:11,238 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:11,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:35:11,417 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:35:11,417 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:11,435 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:11,435 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-02-15 22:35:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:11,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:11,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014692123] [2023-02-15 22:35:11,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014692123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:11,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:11,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:35:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808736460] [2023-02-15 22:35:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:11,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:11,487 INFO L87 Difference]: Start difference. First operand 263 states and 336 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:12,946 INFO L93 Difference]: Finished difference Result 235 states and 252 transitions. [2023-02-15 22:35:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:35:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-02-15 22:35:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:12,948 INFO L225 Difference]: With dead ends: 235 [2023-02-15 22:35:12,948 INFO L226 Difference]: Without dead ends: 235 [2023-02-15 22:35:12,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:12,948 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 397 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:12,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 418 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 22:35:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-15 22:35:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 212. [2023-02-15 22:35:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 150 states have (on average 1.5466666666666666) internal successors, (232), 209 states have internal predecessors, (232), 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) [2023-02-15 22:35:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2023-02-15 22:35:12,952 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 56 [2023-02-15 22:35:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:12,953 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2023-02-15 22:35:12,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2023-02-15 22:35:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:35:12,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:12,954 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] [2023-02-15 22:35:12,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:13,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:13,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash 451837722, now seen corresponding path program 1 times [2023-02-15 22:35:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:13,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943922273] [2023-02-15 22:35:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:13,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:13,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 22:35:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:13,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:35:13,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:13,599 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 22:35:13,599 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:13,621 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:35:13,621 INFO L350 Elim1Store]: Elim1 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 19 [2023-02-15 22:35:13,728 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:35:13,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2023-02-15 22:35:13,751 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:13,751 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-02-15 22:35:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:13,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:13,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:13,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943922273] [2023-02-15 22:35:13,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943922273] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:13,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:35:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586894665] [2023-02-15 22:35:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:13,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:13,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:13,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:13,850 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:14,868 INFO L93 Difference]: Finished difference Result 229 states and 246 transitions. [2023-02-15 22:35:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:35:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-02-15 22:35:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:14,869 INFO L225 Difference]: With dead ends: 229 [2023-02-15 22:35:14,869 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 22:35:14,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:14,870 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 369 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:14,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 363 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:35:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 22:35:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 216. [2023-02-15 22:35:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 155 states have (on average 1.5290322580645161) internal successors, (237), 213 states have internal predecessors, (237), 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) [2023-02-15 22:35:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 239 transitions. [2023-02-15 22:35:14,874 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 239 transitions. Word has length 59 [2023-02-15 22:35:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:14,874 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 239 transitions. [2023-02-15 22:35:14,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 239 transitions. [2023-02-15 22:35:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:35:14,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:14,875 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] [2023-02-15 22:35:14,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:15,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:15,086 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash 270059549, now seen corresponding path program 1 times [2023-02-15 22:35:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:15,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256415404] [2023-02-15 22:35:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:15,089 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:15,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 22:35:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:15,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:35:15,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:15,489 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:35:15,505 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:15,594 INFO L321 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2023-02-15 22:35:15,594 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 30 [2023-02-15 22:35:15,639 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-15 22:35:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:15,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:15,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:15,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256415404] [2023-02-15 22:35:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256415404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:35:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022073807] [2023-02-15 22:35:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:15,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:35:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:35:15,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:35:15,650 INFO L87 Difference]: Start difference. First operand 216 states and 239 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:17,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 22:35:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:18,222 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2023-02-15 22:35:18,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:35:18,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-02-15 22:35:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:18,224 INFO L225 Difference]: With dead ends: 214 [2023-02-15 22:35:18,224 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 22:35:18,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:35:18,224 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 167 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:18,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 453 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 22:35:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 22:35:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-02-15 22:35:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 155 states have (on average 1.5096774193548388) internal successors, (234), 211 states have internal predecessors, (234), 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) [2023-02-15 22:35:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 236 transitions. [2023-02-15 22:35:18,228 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 236 transitions. Word has length 62 [2023-02-15 22:35:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:18,228 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 236 transitions. [2023-02-15 22:35:18,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2023-02-15 22:35:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:35:18,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:18,229 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] [2023-02-15 22:35:18,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-15 22:35:18,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:18,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash 270059550, now seen corresponding path program 1 times [2023-02-15 22:35:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:18,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959974340] [2023-02-15 22:35:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:18,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:18,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:18,442 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:18,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 22:35:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:18,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:35:18,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:18,904 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:35:18,925 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:18,948 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:18,959 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:19,023 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:19,028 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:19,073 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:19,076 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:19,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:19,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959974340] [2023-02-15 22:35:19,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959974340] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:19,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:19,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:35:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567487732] [2023-02-15 22:35:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:19,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:35:19,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:35:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:35:19,094 INFO L87 Difference]: Start difference. First operand 214 states and 236 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:19,815 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2023-02-15 22:35:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:35:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-02-15 22:35:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:19,816 INFO L225 Difference]: With dead ends: 213 [2023-02-15 22:35:19,816 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 22:35:19,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:35:19,817 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 162 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:19,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 455 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:35:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 22:35:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2023-02-15 22:35:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 155 states have (on average 1.4967741935483871) internal successors, (232), 210 states have internal predecessors, (232), 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) [2023-02-15 22:35:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 234 transitions. [2023-02-15 22:35:19,820 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 234 transitions. Word has length 62 [2023-02-15 22:35:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:19,820 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 234 transitions. [2023-02-15 22:35:19,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 234 transitions. [2023-02-15 22:35:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:35:19,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:19,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] [2023-02-15 22:35:19,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:20,033 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1209648968, now seen corresponding path program 1 times [2023-02-15 22:35:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273013396] [2023-02-15 22:35:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:20,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:20,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:20,035 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:20,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 22:35:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:20,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:35:20,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:20,494 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:35:20,528 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:35:20,528 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-02-15 22:35:20,560 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:20,646 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 36 [2023-02-15 22:35:20,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:20,745 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 46 [2023-02-15 22:35:20,775 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 15 [2023-02-15 22:35:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:20,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:20,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:20,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273013396] [2023-02-15 22:35:20,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273013396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:20,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:20,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:35:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692467305] [2023-02-15 22:35:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:20,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:20,807 INFO L87 Difference]: Start difference. First operand 213 states and 234 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:21,857 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2023-02-15 22:35:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:35:21,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-02-15 22:35:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:21,859 INFO L225 Difference]: With dead ends: 236 [2023-02-15 22:35:21,859 INFO L226 Difference]: Without dead ends: 236 [2023-02-15 22:35:21,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:21,859 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 177 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:21,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 507 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:35:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-15 22:35:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 222. [2023-02-15 22:35:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 219 states have internal predecessors, (247), 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) [2023-02-15 22:35:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 249 transitions. [2023-02-15 22:35:21,862 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 249 transitions. Word has length 66 [2023-02-15 22:35:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:21,863 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 249 transitions. [2023-02-15 22:35:21,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 249 transitions. [2023-02-15 22:35:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:35:21,863 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:21,863 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] [2023-02-15 22:35:21,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:22,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:22,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1209648969, now seen corresponding path program 1 times [2023-02-15 22:35:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005252245] [2023-02-15 22:35:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:22,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:22,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:22,072 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:22,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 22:35:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:22,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:35:22,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:22,542 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:35:22,566 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,576 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:22,577 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-02-15 22:35:22,598 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,609 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,698 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,716 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,824 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:22,824 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,830 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,922 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,929 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:22,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:22,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:22,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005252245] [2023-02-15 22:35:22,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005252245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:22,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:22,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:35:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244690507] [2023-02-15 22:35:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:22,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:35:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:22,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:35:22,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:35:22,968 INFO L87 Difference]: Start difference. First operand 222 states and 249 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:24,074 INFO L93 Difference]: Finished difference Result 234 states and 253 transitions. [2023-02-15 22:35:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:35:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-02-15 22:35:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:24,076 INFO L225 Difference]: With dead ends: 234 [2023-02-15 22:35:24,076 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 22:35:24,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:35:24,076 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 194 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:24,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 377 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:35:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 22:35:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 222. [2023-02-15 22:35:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 219 states have internal predecessors, (243), 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) [2023-02-15 22:35:24,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2023-02-15 22:35:24,079 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 66 [2023-02-15 22:35:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:24,080 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2023-02-15 22:35:24,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2023-02-15 22:35:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:35:24,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:24,080 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] [2023-02-15 22:35:24,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:24,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:24,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:24,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -249734821, now seen corresponding path program 1 times [2023-02-15 22:35:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:24,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228665375] [2023-02-15 22:35:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:24,282 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:24,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 22:35:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:24,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:35:24,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:24,836 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:35:24,867 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:35:24,868 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 27 [2023-02-15 22:35:24,897 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:24,959 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 36 [2023-02-15 22:35:25,061 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:25,061 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 46 [2023-02-15 22:35:25,154 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:25,154 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 46 [2023-02-15 22:35:25,189 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 15 [2023-02-15 22:35:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-02-15 22:35:25,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:27,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |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_994) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 22:35:27,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_993 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |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_993))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_994)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 22:35:27,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_993 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_992 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |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_992))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_993)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_994)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 22:35:27,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:35:27,555 INFO L350 Elim1Store]: Elim1 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 116 treesize of output 78 [2023-02-15 22:35:27,559 INFO L350 Elim1Store]: Elim1 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 3087 treesize of output 2376 [2023-02-15 22:35:27,612 INFO L350 Elim1Store]: Elim1 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 2072 treesize of output 1610 [2023-02-15 22:35:27,624 INFO L350 Elim1Store]: Elim1 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 1610 treesize of output 1554 [2023-02-15 22:35:27,635 INFO L350 Elim1Store]: Elim1 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 1554 treesize of output 1358 [2023-02-15 22:35:36,374 INFO L321 Elim1Store]: treesize reduction 24, result has 22.6 percent of original size [2023-02-15 22:35:36,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2023-02-15 22:35:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2023-02-15 22:35:36,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:36,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228665375] [2023-02-15 22:35:36,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228665375] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:36,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:36,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-02-15 22:35:36,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798644719] [2023-02-15 22:35:36,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:36,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:35:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:35:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=186, Unknown=10, NotChecked=90, Total=342 [2023-02-15 22:35:36,384 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:38,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:38,216 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2023-02-15 22:35:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:35:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2023-02-15 22:35:38,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:38,218 INFO L225 Difference]: With dead ends: 230 [2023-02-15 22:35:38,218 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 22:35:38,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=88, Invalid=256, Unknown=10, NotChecked=108, Total=462 [2023-02-15 22:35:38,219 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 198 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:38,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 671 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 478 Invalid, 0 Unknown, 526 Unchecked, 1.5s Time] [2023-02-15 22:35:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 22:35:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2023-02-15 22:35:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 218 states have internal predecessors, (241), 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) [2023-02-15 22:35:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2023-02-15 22:35:38,222 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 71 [2023-02-15 22:35:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:38,222 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2023-02-15 22:35:38,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2023-02-15 22:35:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:35:38,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:38,223 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] [2023-02-15 22:35:38,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-02-15 22:35:38,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:38,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-02-15 22:35:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash -249734820, now seen corresponding path program 1 times [2023-02-15 22:35:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:38,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432911720] [2023-02-15 22:35:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:38,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:35:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:38,449 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:35:38,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 22:35:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:39,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 22:35:39,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:39,077 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:35:39,128 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:39,146 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:39,146 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-02-15 22:35:39,186 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:39,199 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:39,377 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 32 [2023-02-15 22:35:39,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2023-02-15 22:35:39,638 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-15 22:35:39,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 77 [2023-02-15 22:35:39,665 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 22 [2023-02-15 22:35:39,730 INFO L321 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-02-15 22:35:39,730 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 43 [2023-02-15 22:35:39,736 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 3 [2023-02-15 22:35:44,076 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:44,077 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:44,086 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:35:44,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2023-02-15 22:35:44,271 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 13 [2023-02-15 22:35:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:44,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:45,420 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd .cse2 .cse1 (_ bv1 64))))))) is different from false [2023-02-15 22:35:45,509 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-02-15 22:35:45,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-02-15 22:35:45,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1113))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1112) .cse0 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1112) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-02-15 22:35:45,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1113))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1112) .cse1 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1112) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-02-15 22:35:48,030 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|) (bvadd .cse7 |c_ULTIMATE.start_main_~mem_track~0#1.offset|) |c_ULTIMATE.start_main_#t~mem141#1.base|))) (.cse4 (bvadd .cse7 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1110) .cse2 v_ArrVal_1112) (select (select (store .cse3 .cse2 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse3 .cse2 v_ArrVal_1113))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1110) .cse2 v_ArrVal_1112) .cse5 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-02-15 22:35:48,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|) (_ bv8 64)))) (let ((.cse4 (bvadd .cse7 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|) (bvadd .cse7 |c_ULTIMATE.start_main_~mem_track~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1110) .cse2 v_ArrVal_1112) (select (select (store .cse3 .cse2 v_ArrVal_1113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1114 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1115 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse3 .cse2 v_ArrVal_1113))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1110) .cse2 v_ArrVal_1112) .cse5 v_ArrVal_1115) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))) is different from false [2023-02-15 22:35:48,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:35:48,637 INFO L350 Elim1Store]: Elim1 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 388 treesize of output 389 [2023-02-15 22:35:48,748 INFO L321 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2023-02-15 22:35:48,748 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 183 treesize of output 93 [2023-02-15 22:35:48,773 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-02-15 22:35:48,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 552 treesize of output 444 [2023-02-15 22:35:48,783 INFO L350 Elim1Store]: Elim1 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 3527 treesize of output 3374 [2023-02-15 22:35:48,801 INFO L350 Elim1Store]: Elim1 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 3370 treesize of output 3034 [2023-02-15 22:35:48,813 INFO L350 Elim1Store]: Elim1 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 3034 treesize of output 2698 [2023-02-15 22:35:48,825 INFO L350 Elim1Store]: Elim1 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 2698 treesize of output 2054 [2023-02-15 22:35:48,840 INFO L350 Elim1Store]: Elim1 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 2054 treesize of output 1942 [2023-02-15 22:35:48,851 INFO L350 Elim1Store]: Elim1 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 1942 treesize of output 1830