./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:08:03,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:08:03,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:08:03,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:08:03,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:08:03,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:08:03,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:08:03,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:08:03,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:08:03,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:08:03,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:08:03,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:08:03,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:08:03,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:08:03,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:08:03,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:08:03,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:08:03,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:08:03,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:08:03,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:08:03,662 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:08:03,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:08:03,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:08:03,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:08:03,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:08:03,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:08:03,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:08:03,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:08:03,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:08:03,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:08:03,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:08:03,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:08:03,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:08:03,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:08:03,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:08:03,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:08:03,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:08:03,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:08:03,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:08:03,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:08:03,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:08:03,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:08:03,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-13 01:08:03,702 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:08:03,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:08:03,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:08:03,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:08:03,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:08:03,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:08:03,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:08:03,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:08:03,704 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:08:03,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:08:03,705 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:08:03,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:08:03,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:08:03,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:08:03,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:08:03,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:08:03,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:08:03,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:08:03,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:08:03,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:08:03,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:08:03,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2022-07-13 01:08:03,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:08:03,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:08:03,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:08:03,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:08:03,915 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:08:03,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-13 01:08:03,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69264a967/9da240c6633347ce8723e6b1238462af/FLAG30baab988 [2022-07-13 01:08:04,422 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:08:04,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-13 01:08:04,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69264a967/9da240c6633347ce8723e6b1238462af/FLAG30baab988 [2022-07-13 01:08:04,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69264a967/9da240c6633347ce8723e6b1238462af [2022-07-13 01:08:04,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:08:04,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:08:04,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:08:04,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:08:04,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:08:04,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:08:04" (1/1) ... [2022-07-13 01:08:04,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eff727d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:04, skipping insertion in model container [2022-07-13 01:08:04,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:08:04" (1/1) ... [2022-07-13 01:08:04,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:08:04,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:08:04,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-13 01:08:04,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:08:04,971 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-13 01:08:04,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@531dfadc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:04, skipping insertion in model container [2022-07-13 01:08:04,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:08:04,972 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:08:04,973 INFO L158 Benchmark]: Toolchain (without parser) took 511.55ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 56.8MB in the beginning and 76.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-13 01:08:04,974 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:08:04,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.80ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 56.7MB in the beginning and 76.3MB in the end (delta: -19.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-13 01:08:04,978 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.16ms. Allocated memory is still 92.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.80ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 56.7MB in the beginning and 76.3MB in the end (delta: -19.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:08:06,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:08:06,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:08:06,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:08:06,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:08:06,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:08:06,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:08:06,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:08:06,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:08:06,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:08:06,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:08:06,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:08:06,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:08:06,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:08:06,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:08:06,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:08:06,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:08:06,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:08:06,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:08:06,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:08:06,474 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:08:06,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:08:06,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:08:06,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:08:06,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:08:06,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:08:06,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:08:06,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:08:06,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:08:06,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:08:06,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:08:06,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:08:06,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:08:06,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:08:06,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:08:06,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:08:06,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:08:06,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:08:06,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:08:06,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:08:06,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:08:06,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:08:06,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-13 01:08:06,515 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:08:06,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:08:06,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:08:06,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:08:06,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:08:06,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:08:06,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:08:06,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:08:06,517 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:08:06,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:08:06,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:08:06,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:08:06,519 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:08:06,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:08:06,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:08:06,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:08:06,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:08:06,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:08:06,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:08:06,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:08:06,521 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:08:06,521 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:08:06,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:08:06,521 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2022-07-13 01:08:06,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:08:06,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:08:06,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:08:06,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:08:06,819 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:08:06,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-13 01:08:06,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf46c62b5/e45815bdfbe84becb3958b5c8c70ffd4/FLAGf256ea0ad [2022-07-13 01:08:07,311 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:08:07,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2022-07-13 01:08:07,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf46c62b5/e45815bdfbe84becb3958b5c8c70ffd4/FLAGf256ea0ad [2022-07-13 01:08:07,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf46c62b5/e45815bdfbe84becb3958b5c8c70ffd4 [2022-07-13 01:08:07,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:08:07,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:08:07,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:08:07,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:08:07,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:08:07,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:08:07" (1/1) ... [2022-07-13 01:08:07,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bb89f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:07, skipping insertion in model container [2022-07-13 01:08:07,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:08:07" (1/1) ... [2022-07-13 01:08:07,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:08:07,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:08:08,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-13 01:08:08,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:08:08,092 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:08:08,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:08:08,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-13 01:08:08,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:08:08,200 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:08:08,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2022-07-13 01:08:08,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:08:08,349 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:08:08,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08 WrapperNode [2022-07-13 01:08:08,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:08:08,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:08:08,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:08:08,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:08:08,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,422 INFO L137 Inliner]: procedures = 353, calls = 114, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 386 [2022-07-13 01:08:08,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:08:08,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:08:08,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:08:08,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:08:08,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:08:08,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:08:08,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:08:08,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:08:08,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (1/1) ... [2022-07-13 01:08:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:08:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:08:08,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 01:08:08,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 01:08:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:08:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:08:08,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 01:08:08,530 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 01:08:08,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:08:08,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 01:08:08,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:08:08,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:08:08,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:08:08,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:08:08,843 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:08:08,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:08:09,654 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:08:09,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:08:09,660 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-13 01:08:09,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:08:09 BoogieIcfgContainer [2022-07-13 01:08:09,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:08:09,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:08:09,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:08:09,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:08:09,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:08:07" (1/3) ... [2022-07-13 01:08:09,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381bb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:08:09, skipping insertion in model container [2022-07-13 01:08:09,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:08:08" (2/3) ... [2022-07-13 01:08:09,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381bb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:08:09, skipping insertion in model container [2022-07-13 01:08:09,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:08:09" (3/3) ... [2022-07-13 01:08:09,670 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-2.i [2022-07-13 01:08:09,682 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:08:09,682 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2022-07-13 01:08:09,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:08:09,717 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5062c100, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@723847f4 [2022-07-13 01:08:09,718 INFO L358 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2022-07-13 01:08:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:08:09,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:09,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:08:09,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2022-07-13 01:08:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:09,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838560124] [2022-07-13 01:08:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:09,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:09,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:09,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:09,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 01:08:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:09,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:08:09,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:09,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:09,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:09,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:09,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838560124] [2022-07-13 01:08:09,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838560124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:09,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:09,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:08:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024144695] [2022-07-13 01:08:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:09,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:08:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:09,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:08:09,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:09,958 INFO L87 Difference]: Start difference. First operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:10,347 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2022-07-13 01:08:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:08:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:08:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:10,355 INFO L225 Difference]: With dead ends: 253 [2022-07-13 01:08:10,355 INFO L226 Difference]: Without dead ends: 251 [2022-07-13 01:08:10,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:10,358 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 241 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:10,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:08:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-13 01:08:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2022-07-13 01:08:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2022-07-13 01:08:10,424 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 3 [2022-07-13 01:08:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:10,425 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2022-07-13 01:08:10,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2022-07-13 01:08:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:08:10,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:10,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:08:10,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:10,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:10,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2022-07-13 01:08:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:10,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767286536] [2022-07-13 01:08:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:10,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:10,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:10,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 01:08:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:10,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:08:10,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:10,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:10,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:10,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:10,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767286536] [2022-07-13 01:08:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767286536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:10,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:10,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:08:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264719923] [2022-07-13 01:08:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:10,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:08:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:08:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:10,764 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:11,284 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2022-07-13 01:08:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:08:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:08:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:11,286 INFO L225 Difference]: With dead ends: 234 [2022-07-13 01:08:11,286 INFO L226 Difference]: Without dead ends: 234 [2022-07-13 01:08:11,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:11,287 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:11,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 430 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 01:08:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-13 01:08:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-07-13 01:08:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2022-07-13 01:08:11,302 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 3 [2022-07-13 01:08:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:11,302 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2022-07-13 01:08:11,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-07-13 01:08:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:08:11,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:11,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:08:11,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:11,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:11,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2022-07-13 01:08:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:11,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223380730] [2022-07-13 01:08:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:11,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:11,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:11,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:11,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 01:08:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:11,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:08:11,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:11,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:11,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:11,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223380730] [2022-07-13 01:08:11,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223380730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:11,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:11,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:08:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054249113] [2022-07-13 01:08:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:08:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:08:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:08:11,670 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:12,202 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2022-07-13 01:08:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:08:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-13 01:08:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:12,213 INFO L225 Difference]: With dead ends: 238 [2022-07-13 01:08:12,213 INFO L226 Difference]: Without dead ends: 238 [2022-07-13 01:08:12,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:08:12,214 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:12,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 431 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 01:08:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-13 01:08:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2022-07-13 01:08:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2022-07-13 01:08:12,225 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 6 [2022-07-13 01:08:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:12,225 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2022-07-13 01:08:12,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2022-07-13 01:08:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 01:08:12,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:12,226 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:12,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:12,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:12,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2080656212, now seen corresponding path program 1 times [2022-07-13 01:08:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:12,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158388628] [2022-07-13 01:08:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:12,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:12,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 01:08:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:12,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:08:12,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:12,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:12,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:13,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:13,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158388628] [2022-07-13 01:08:13,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158388628] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:08:13,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:08:13,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-13 01:08:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374560746] [2022-07-13 01:08:13,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:08:13,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:08:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:08:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:08:13,604 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:16,862 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2022-07-13 01:08:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:08:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 01:08:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:16,865 INFO L225 Difference]: With dead ends: 242 [2022-07-13 01:08:16,865 INFO L226 Difference]: Without dead ends: 242 [2022-07-13 01:08:16,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:08:16,866 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 31 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:16,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1116 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 01:08:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-13 01:08:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-13 01:08:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2022-07-13 01:08:16,879 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 10 [2022-07-13 01:08:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:16,879 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2022-07-13 01:08:16,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2022-07-13 01:08:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 01:08:16,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:16,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:16,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 01:08:17,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:17,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1026813049, now seen corresponding path program 1 times [2022-07-13 01:08:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:17,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102135825] [2022-07-13 01:08:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:17,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:17,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:17,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 01:08:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:17,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:08:17,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:17,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:17,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102135825] [2022-07-13 01:08:17,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102135825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:08:17,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:08:17,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-13 01:08:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843823470] [2022-07-13 01:08:17,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:08:17,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:08:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:17,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:08:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:08:17,324 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:17,516 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2022-07-13 01:08:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:08:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 01:08:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:17,518 INFO L225 Difference]: With dead ends: 262 [2022-07-13 01:08:17,518 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 01:08:17,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-13 01:08:17,519 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 24 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:17,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1835 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:08:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 01:08:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-13 01:08:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2022-07-13 01:08:17,526 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 19 [2022-07-13 01:08:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:17,527 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2022-07-13 01:08:17,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2022-07-13 01:08:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 01:08:17,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:17,528 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:17,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:17,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:17,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098840, now seen corresponding path program 2 times [2022-07-13 01:08:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:17,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556191911] [2022-07-13 01:08:17,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:08:17,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:17,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:17,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:17,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 01:08:17,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 01:08:17,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:08:17,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:08:17,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:17,885 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:08:17,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-13 01:08:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 01:08:18,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:18,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:18,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556191911] [2022-07-13 01:08:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556191911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:18,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 01:08:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501485371] [2022-07-13 01:08:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:18,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:08:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:18,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:08:18,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:18,030 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:18,277 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2022-07-13 01:08:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:08:18,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 01:08:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:18,278 INFO L225 Difference]: With dead ends: 277 [2022-07-13 01:08:18,278 INFO L226 Difference]: Without dead ends: 277 [2022-07-13 01:08:18,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:18,279 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 237 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:18,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:08:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-13 01:08:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2022-07-13 01:08:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 294 transitions. [2022-07-13 01:08:18,285 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 294 transitions. Word has length 39 [2022-07-13 01:08:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:18,286 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 294 transitions. [2022-07-13 01:08:18,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2022-07-13 01:08:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 01:08:18,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:18,286 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:18,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:18,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098841, now seen corresponding path program 1 times [2022-07-13 01:08:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:18,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438018036] [2022-07-13 01:08:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:18,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:18,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:18,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 01:08:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:18,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 01:08:18,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:18,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:08:18,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:18,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438018036] [2022-07-13 01:08:18,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438018036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:08:18,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:08:18,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-13 01:08:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936376349] [2022-07-13 01:08:18,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:08:18,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 01:08:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:18,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 01:08:18,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:08:18,952 INFO L87 Difference]: Start difference. First operand 261 states and 294 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:19,257 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2022-07-13 01:08:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 01:08:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-13 01:08:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:19,264 INFO L225 Difference]: With dead ends: 269 [2022-07-13 01:08:19,265 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 01:08:19,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:08:19,270 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 30 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:19,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3441 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:08:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 01:08:19,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-13 01:08:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 302 transitions. [2022-07-13 01:08:19,283 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 302 transitions. Word has length 39 [2022-07-13 01:08:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:19,283 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 302 transitions. [2022-07-13 01:08:19,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2022-07-13 01:08:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 01:08:19,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:19,286 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:19,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:19,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:19,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 233252627, now seen corresponding path program 2 times [2022-07-13 01:08:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352031971] [2022-07-13 01:08:19,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:08:19,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:19,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:19,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:19,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 01:08:19,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 01:08:19,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:08:19,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:08:19,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:19,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:08:19,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 01:08:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:19,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:19,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:19,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352031971] [2022-07-13 01:08:19,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352031971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:19,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:19,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:08:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880756840] [2022-07-13 01:08:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:19,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:08:19,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:08:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:08:19,869 INFO L87 Difference]: Start difference. First operand 269 states and 302 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:20,367 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2022-07-13 01:08:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:08:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-13 01:08:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:20,369 INFO L225 Difference]: With dead ends: 284 [2022-07-13 01:08:20,369 INFO L226 Difference]: Without dead ends: 284 [2022-07-13 01:08:20,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:08:20,370 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 275 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:20,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 158 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 01:08:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-13 01:08:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-07-13 01:08:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2022-07-13 01:08:20,374 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2022-07-13 01:08:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:20,374 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2022-07-13 01:08:20,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:08:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2022-07-13 01:08:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 01:08:20,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:20,375 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:20,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:20,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:20,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773764, now seen corresponding path program 1 times [2022-07-13 01:08:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:20,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345037798] [2022-07-13 01:08:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:20,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:20,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:20,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 01:08:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:20,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:08:20,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:20,897 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:08:20,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-13 01:08:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:20,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:20,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:20,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345037798] [2022-07-13 01:08:20,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345037798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:20,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:20,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:08:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339459517] [2022-07-13 01:08:20,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:20,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:08:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:20,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:08:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:20,918 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:21,222 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-07-13 01:08:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:08:21,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-13 01:08:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:21,223 INFO L225 Difference]: With dead ends: 279 [2022-07-13 01:08:21,224 INFO L226 Difference]: Without dead ends: 279 [2022-07-13 01:08:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:08:21,224 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 222 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 211 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:08:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-13 01:08:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2022-07-13 01:08:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2022-07-13 01:08:21,229 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 55 [2022-07-13 01:08:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:21,230 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2022-07-13 01:08:21,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-07-13 01:08:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 01:08:21,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:21,231 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:21,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:21,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:21,443 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:21,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773765, now seen corresponding path program 1 times [2022-07-13 01:08:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:21,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216373630] [2022-07-13 01:08:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:21,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:21,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:21,445 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:21,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 01:08:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:21,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:08:21,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:21,833 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-13 01:08:21,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:08:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:21,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:21,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:21,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216373630] [2022-07-13 01:08:21,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216373630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:21,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:21,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:08:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262850482] [2022-07-13 01:08:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:21,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:08:21,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:21,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:08:21,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:08:21,912 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:23,168 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2022-07-13 01:08:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:08:23,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-13 01:08:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:23,170 INFO L225 Difference]: With dead ends: 443 [2022-07-13 01:08:23,170 INFO L226 Difference]: Without dead ends: 443 [2022-07-13 01:08:23,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:08:23,171 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 642 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:23,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 778 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 01:08:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-13 01:08:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 367. [2022-07-13 01:08:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 01:08:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2022-07-13 01:08:23,176 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 55 [2022-07-13 01:08:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:23,177 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2022-07-13 01:08:23,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2022-07-13 01:08:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:08:23,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:23,177 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:23,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-13 01:08:23,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:23,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2067963466, now seen corresponding path program 1 times [2022-07-13 01:08:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:23,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067948906] [2022-07-13 01:08:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:23,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:23,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:23,397 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:23,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 01:08:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:23,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:08:23,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:23,868 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-13 01:08:23,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:08:24,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:08:24,121 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 01:08:24,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2022-07-13 01:08:24,134 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:08:24,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:08:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:24,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:24,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:24,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067948906] [2022-07-13 01:08:24,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067948906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:24,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:24,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:08:24,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645137298] [2022-07-13 01:08:24,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:24,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:08:24,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:24,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:08:24,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:08:24,233 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:24,327 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2022-07-13 01:08:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:08:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-13 01:08:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:24,328 INFO L225 Difference]: With dead ends: 368 [2022-07-13 01:08:24,328 INFO L226 Difference]: Without dead ends: 368 [2022-07-13 01:08:24,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:08:24,329 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:24,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1444 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 305 Unchecked, 0.0s Time] [2022-07-13 01:08:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-13 01:08:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-07-13 01:08:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 01:08:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 496 transitions. [2022-07-13 01:08:24,335 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 496 transitions. Word has length 58 [2022-07-13 01:08:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:24,336 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 496 transitions. [2022-07-13 01:08:24,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2022-07-13 01:08:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:08:24,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:24,337 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:24,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:24,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:24,547 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:24,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:24,548 INFO L85 PathProgramCache]: Analyzing trace with hash -317642580, now seen corresponding path program 1 times [2022-07-13 01:08:24,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575353068] [2022-07-13 01:08:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:24,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:24,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:24,550 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:24,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 01:08:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:24,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:08:24,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:24,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:24,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:24,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575353068] [2022-07-13 01:08:24,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575353068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:24,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:24,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:08:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166850161] [2022-07-13 01:08:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:24,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:08:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:24,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:08:24,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:08:24,829 INFO L87 Difference]: Start difference. First operand 368 states and 496 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:25,069 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2022-07-13 01:08:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:08:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-07-13 01:08:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:25,071 INFO L225 Difference]: With dead ends: 286 [2022-07-13 01:08:25,071 INFO L226 Difference]: Without dead ends: 286 [2022-07-13 01:08:25,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:08:25,071 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 263 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:25,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 952 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:08:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-13 01:08:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2022-07-13 01:08:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 297 transitions. [2022-07-13 01:08:25,075 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 297 transitions. Word has length 59 [2022-07-13 01:08:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:25,075 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 297 transitions. [2022-07-13 01:08:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 297 transitions. [2022-07-13 01:08:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 01:08:25,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:25,076 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:25,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:25,277 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1256967413, now seen corresponding path program 1 times [2022-07-13 01:08:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:25,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324911521] [2022-07-13 01:08:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:25,279 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:25,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 01:08:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:25,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:08:25,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:25,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:25,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324911521] [2022-07-13 01:08:25,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324911521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:25,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:25,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:08:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265707162] [2022-07-13 01:08:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:25,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:08:25,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:08:25,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:08:25,557 INFO L87 Difference]: Start difference. First operand 264 states and 297 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:26,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:26,208 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2022-07-13 01:08:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:08:26,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-07-13 01:08:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:26,210 INFO L225 Difference]: With dead ends: 282 [2022-07-13 01:08:26,210 INFO L226 Difference]: Without dead ends: 282 [2022-07-13 01:08:26,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:08:26,210 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 277 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:26,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 631 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 01:08:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-13 01:08:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2022-07-13 01:08:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2022-07-13 01:08:26,214 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 60 [2022-07-13 01:08:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:26,215 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2022-07-13 01:08:26,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2022-07-13 01:08:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 01:08:26,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:26,216 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:26,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:26,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:26,431 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash -311284142, now seen corresponding path program 1 times [2022-07-13 01:08:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:26,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840015980] [2022-07-13 01:08:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:26,434 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:26,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 01:08:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:26,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:08:26,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:26,833 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:08:26,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-13 01:08:26,851 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:08:26,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2022-07-13 01:08:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:26,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:26,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:26,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840015980] [2022-07-13 01:08:26,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840015980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:26,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:26,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:08:26,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487397992] [2022-07-13 01:08:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:26,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:08:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:08:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:08:26,888 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:27,307 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2022-07-13 01:08:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:08:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-07-13 01:08:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:27,309 INFO L225 Difference]: With dead ends: 282 [2022-07-13 01:08:27,309 INFO L226 Difference]: Without dead ends: 282 [2022-07-13 01:08:27,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:08:27,310 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 214 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:27,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 373 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:08:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-13 01:08:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2022-07-13 01:08:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2022-07-13 01:08:27,315 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 61 [2022-07-13 01:08:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:27,315 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2022-07-13 01:08:27,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2022-07-13 01:08:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 01:08:27,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:27,316 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:27,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:27,534 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -311284141, now seen corresponding path program 1 times [2022-07-13 01:08:27,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:27,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458770644] [2022-07-13 01:08:27,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:27,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:27,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:27,536 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:27,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 01:08:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:27,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 01:08:27,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:28,005 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-13 01:08:28,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 01:08:28,035 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:08:28,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-13 01:08:28,205 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:08:28,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:08:28,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-13 01:08:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:28,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:28,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:28,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458770644] [2022-07-13 01:08:28,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458770644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:28,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:28,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:08:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973409010] [2022-07-13 01:08:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:28,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:08:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:08:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:08:28,388 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:28,495 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2022-07-13 01:08:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:08:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-07-13 01:08:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:28,496 INFO L225 Difference]: With dead ends: 279 [2022-07-13 01:08:28,497 INFO L226 Difference]: Without dead ends: 279 [2022-07-13 01:08:28,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:08:28,497 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 4 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:28,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1426 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 303 Unchecked, 0.0s Time] [2022-07-13 01:08:28,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-13 01:08:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-07-13 01:08:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.601010101010101) internal successors, (317), 275 states have internal predecessors, (317), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 321 transitions. [2022-07-13 01:08:28,501 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 321 transitions. Word has length 61 [2022-07-13 01:08:28,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:28,502 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 321 transitions. [2022-07-13 01:08:28,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 321 transitions. [2022-07-13 01:08:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 01:08:28,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:28,502 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:28,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:28,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:28,711 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash -631451440, now seen corresponding path program 1 times [2022-07-13 01:08:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:28,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049536650] [2022-07-13 01:08:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:28,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:28,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:28,713 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:28,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 01:08:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:29,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:08:29,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:29,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:29,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:29,296 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-13 01:08:29,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-07-13 01:08:29,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2022-07-13 01:08:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:29,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:29,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:29,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049536650] [2022-07-13 01:08:29,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049536650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:29,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:29,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 01:08:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320544237] [2022-07-13 01:08:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:29,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:08:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:29,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:08:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:08:29,370 INFO L87 Difference]: Start difference. First operand 279 states and 321 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:30,302 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2022-07-13 01:08:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:08:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-07-13 01:08:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:30,303 INFO L225 Difference]: With dead ends: 277 [2022-07-13 01:08:30,303 INFO L226 Difference]: Without dead ends: 277 [2022-07-13 01:08:30,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:08:30,304 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 232 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:30,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1042 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 01:08:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-13 01:08:30,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-07-13 01:08:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 273 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2022-07-13 01:08:30,307 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 64 [2022-07-13 01:08:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:30,308 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2022-07-13 01:08:30,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2022-07-13 01:08:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 01:08:30,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:30,309 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:30,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:30,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:30,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash -631451439, now seen corresponding path program 1 times [2022-07-13 01:08:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963979284] [2022-07-13 01:08:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:30,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:30,525 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:30,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 01:08:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:30,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 01:08:30,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:30,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:08:30,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:31,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:31,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:31,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-13 01:08:31,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:08:31,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-13 01:08:31,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2022-07-13 01:08:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:31,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:31,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:31,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963979284] [2022-07-13 01:08:31,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963979284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:31,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:31,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:08:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896098234] [2022-07-13 01:08:31,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:31,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 01:08:31,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 01:08:31,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:08:31,170 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:32,130 INFO L93 Difference]: Finished difference Result 276 states and 315 transitions. [2022-07-13 01:08:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:08:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-07-13 01:08:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:32,132 INFO L225 Difference]: With dead ends: 276 [2022-07-13 01:08:32,132 INFO L226 Difference]: Without dead ends: 276 [2022-07-13 01:08:32,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:08:32,132 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 240 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:32,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 734 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 01:08:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-13 01:08:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-07-13 01:08:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 198 states have (on average 1.5707070707070707) internal successors, (311), 272 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2022-07-13 01:08:32,136 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 64 [2022-07-13 01:08:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:32,136 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2022-07-13 01:08:32,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2022-07-13 01:08:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 01:08:32,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:32,136 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:32,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:32,344 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -889593477, now seen corresponding path program 1 times [2022-07-13 01:08:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:32,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968634962] [2022-07-13 01:08:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:32,346 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:32,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 01:08:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:32,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 01:08:32,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:32,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:08:32,988 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:08:32,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:08:33,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:33,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-13 01:08:33,188 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:33,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-13 01:08:33,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:08:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:33,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:33,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:33,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968634962] [2022-07-13 01:08:33,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968634962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:33,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:33,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:08:33,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836086709] [2022-07-13 01:08:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:33,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:08:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:33,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:08:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:08:33,278 INFO L87 Difference]: Start difference. First operand 276 states and 315 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:34,134 INFO L93 Difference]: Finished difference Result 297 states and 337 transitions. [2022-07-13 01:08:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:08:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-07-13 01:08:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:34,135 INFO L225 Difference]: With dead ends: 297 [2022-07-13 01:08:34,136 INFO L226 Difference]: Without dead ends: 297 [2022-07-13 01:08:34,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 01:08:34,136 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 493 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:34,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 649 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 107 Unchecked, 0.7s Time] [2022-07-13 01:08:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-13 01:08:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2022-07-13 01:08:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 281 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 330 transitions. [2022-07-13 01:08:34,140 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 330 transitions. Word has length 68 [2022-07-13 01:08:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:34,140 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 330 transitions. [2022-07-13 01:08:34,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 330 transitions. [2022-07-13 01:08:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 01:08:34,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:34,140 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:34,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:34,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:34,352 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash -889593476, now seen corresponding path program 1 times [2022-07-13 01:08:34,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:34,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130666115] [2022-07-13 01:08:34,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:34,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:34,358 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:34,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 01:08:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:34,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:08:34,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:34,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:08:34,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:34,923 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:08:34,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:08:34,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:34,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:35,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-13 01:08:35,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:08:35,131 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:35,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-13 01:08:35,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 01:08:35,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:08:35,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-13 01:08:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:35,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:35,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130666115] [2022-07-13 01:08:35,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130666115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:35,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:35,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 01:08:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366902532] [2022-07-13 01:08:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:08:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:08:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:08:35,243 INFO L87 Difference]: Start difference. First operand 285 states and 330 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:36,944 INFO L93 Difference]: Finished difference Result 297 states and 334 transitions. [2022-07-13 01:08:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:08:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-07-13 01:08:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:36,946 INFO L225 Difference]: With dead ends: 297 [2022-07-13 01:08:36,946 INFO L226 Difference]: Without dead ends: 297 [2022-07-13 01:08:36,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 01:08:36,947 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 482 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 669 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 01:08:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-13 01:08:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2022-07-13 01:08:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5555555555555556) internal successors, (322), 281 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2022-07-13 01:08:36,951 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 68 [2022-07-13 01:08:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:36,951 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2022-07-13 01:08:36,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2022-07-13 01:08:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 01:08:36,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:36,952 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:36,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-13 01:08:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:37,167 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash -269261804, now seen corresponding path program 1 times [2022-07-13 01:08:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932315420] [2022-07-13 01:08:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:37,169 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:37,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 01:08:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:37,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 01:08:37,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:37,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:08:37,923 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:08:37,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:08:37,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:38,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-13 01:08:38,116 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:38,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-13 01:08:38,197 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:38,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-13 01:08:38,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:08:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-13 01:08:38,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:38,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1548) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-13 01:08:38,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:08:38,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:08:38,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1546))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))) is different from false [2022-07-13 01:08:38,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:08:38,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2022-07-13 01:08:38,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2665 treesize of output 1963 [2022-07-13 01:08:38,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1959 treesize of output 1644 [2022-07-13 01:08:38,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1644 treesize of output 1294 [2022-07-13 01:08:38,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1294 treesize of output 1266 [2022-07-13 01:08:43,159 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-13 01:08:43,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2022-07-13 01:08:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2022-07-13 01:08:43,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:43,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932315420] [2022-07-13 01:08:43,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932315420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:08:43,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:08:43,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-13 01:08:43,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135574775] [2022-07-13 01:08:43,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:08:43,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 01:08:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:43,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 01:08:43,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=164, Unknown=7, NotChecked=116, Total=342 [2022-07-13 01:08:43,171 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:44,676 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2022-07-13 01:08:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:08:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-07-13 01:08:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:44,677 INFO L225 Difference]: With dead ends: 287 [2022-07-13 01:08:44,677 INFO L226 Difference]: Without dead ends: 287 [2022-07-13 01:08:44,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=74, Invalid=207, Unknown=7, NotChecked=132, Total=420 [2022-07-13 01:08:44,678 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 20 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 802 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:44,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2318 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 802 Unchecked, 1.0s Time] [2022-07-13 01:08:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-13 01:08:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-07-13 01:08:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5507246376811594) internal successors, (321), 281 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2022-07-13 01:08:44,682 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 73 [2022-07-13 01:08:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:44,682 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2022-07-13 01:08:44,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:08:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2022-07-13 01:08:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 01:08:44,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:44,683 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:44,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:44,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:44,899 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-07-13 01:08:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash -269261803, now seen corresponding path program 1 times [2022-07-13 01:08:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:44,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313289307] [2022-07-13 01:08:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:44,902 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:44,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 01:08:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:45,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 01:08:45,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:45,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-13 01:08:45,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:08:45,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:08:45,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:08:45,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:45,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:45,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-13 01:08:45,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:08:45,843 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:45,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-13 01:08:45,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 01:08:46,000 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:46,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-13 01:08:46,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 01:08:46,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-13 01:08:46,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-13 01:08:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-13 01:08:46,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:47,221 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2022-07-13 01:08:47,321 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse2 .cse3) (bvadd (_ bv1 64) .cse2 .cse3))))) is different from false [2022-07-13 01:08:47,427 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2022-07-13 01:08:47,489 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse4 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64)))))) is different from false [2022-07-13 01:08:47,678 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1678))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1679) .cse1 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1680)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-13 01:08:47,987 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse2 v_ArrVal_1679) (select (select (store .cse3 .cse2 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1678))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse5 v_ArrVal_1679) .cse6 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) (_ bv1 64)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2022-07-13 01:08:48,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:08:48,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2022-07-13 01:08:48,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:08:48,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2022-07-13 01:08:48,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5607 treesize of output 4554 [2022-07-13 01:08:48,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92771 treesize of output 89882 [2022-07-13 01:08:48,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89878 treesize of output 81366 [2022-07-13 01:08:48,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81366 treesize of output 79126 [2022-07-13 01:08:48,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79126 treesize of output 70054 [2022-07-13 01:08:48,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70054 treesize of output 61542 [2022-07-13 01:08:49,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61542 treesize of output 50874 [2022-07-13 01:08:49,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50874 treesize of output 46842