./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:48:45,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:48:45,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:48:45,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:48:45,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:48:45,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:48:45,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:48:45,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:48:45,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:48:45,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:48:45,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:48:45,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:48:45,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:48:45,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:48:45,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:48:45,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:48:45,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:48:45,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:48:45,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:48:45,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:48:45,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:48:45,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:48:45,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:48:45,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:48:45,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:48:45,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:48:45,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:48:45,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:48:45,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:48:45,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:48:45,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:48:45,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:48:45,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:48:45,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:48:45,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:48:45,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:48:45,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:48:45,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:48:45,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:48:45,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:48:45,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:48:45,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 08:48:45,182 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:48:45,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:48:45,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:48:45,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:48:45,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:48:45,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:48:45,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:48:45,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:48:45,185 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:48:45,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:48:45,186 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:48:45,187 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:48:45,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:48:45,187 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:48:45,187 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:48:45,187 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:48:45,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:48:45,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:48:45,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:48:45,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:48:45,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:48:45,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:48:45,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 08:48:45,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 08:48:45,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:48:45,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2021-12-16 08:48:45,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:48:45,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:48:45,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:48:45,407 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:48:45,408 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:48:45,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-12-16 08:48:45,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb398bdc0/2ae29fd87a6144d29fbc40ea79407b7f/FLAG120c10dee [2021-12-16 08:48:45,858 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:48:45,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-12-16 08:48:45,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb398bdc0/2ae29fd87a6144d29fbc40ea79407b7f/FLAG120c10dee [2021-12-16 08:48:46,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb398bdc0/2ae29fd87a6144d29fbc40ea79407b7f [2021-12-16 08:48:46,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:48:46,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:48:46,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:48:46,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:48:46,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:48:46,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:48:46" (1/1) ... [2021-12-16 08:48:46,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6151be41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:46, skipping insertion in model container [2021-12-16 08:48:46,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:48:46" (1/1) ... [2021-12-16 08:48:46,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:48:46,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:48:46,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-12-16 08:48:46,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-12-16 08:48:46,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-12-16 08:48:46,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:48:46,609 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-16 08:48:46,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1c85a43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:46, skipping insertion in model container [2021-12-16 08:48:46,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:48:46,610 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-16 08:48:46,611 INFO L158 Benchmark]: Toolchain (without parser) took 409.57ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 53.3MB in the beginning and 91.2MB in the end (delta: -37.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 08:48:46,612 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 45.6MB in the beginning and 45.5MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 08:48:46,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.89ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 53.1MB in the beginning and 91.2MB in the end (delta: -38.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 08:48:46,615 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 88.1MB. Free memory was 45.6MB in the beginning and 45.5MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.89ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 53.1MB in the beginning and 91.2MB in the end (delta: -38.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:48:48,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:48:48,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:48:48,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:48:48,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:48:48,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:48:48,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:48:48,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:48:48,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:48:48,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:48:48,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:48:48,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:48:48,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:48:48,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:48:48,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:48:48,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:48:48,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:48:48,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:48:48,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:48:48,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:48:48,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:48:48,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:48:48,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:48:48,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:48:48,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:48:48,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:48:48,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:48:48,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:48:48,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:48:48,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:48:48,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:48:48,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:48:48,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:48:48,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:48:48,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:48:48,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:48:48,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:48:48,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:48:48,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:48:48,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:48:48,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:48:48,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 08:48:48,194 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:48:48,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:48:48,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:48:48,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:48:48,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:48:48,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:48:48,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:48:48,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:48:48,198 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:48:48,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:48:48,198 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:48:48,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:48:48,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:48:48,200 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 08:48:48,200 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 08:48:48,200 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:48:48,200 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:48:48,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:48:48,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:48:48,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:48:48,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:48:48,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:48:48,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:48:48,208 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 08:48:48,208 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 08:48:48,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:48:48,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 08:48:48,209 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2021-12-16 08:48:48,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:48:48,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:48:48,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:48:48,477 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:48:48,480 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:48:48,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-12-16 08:48:48,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3595a4a4f/2b3bdb59b24c474bb2d2bbcdd0fc6560/FLAGc6f77cc05 [2021-12-16 08:48:49,019 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:48:49,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2021-12-16 08:48:49,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3595a4a4f/2b3bdb59b24c474bb2d2bbcdd0fc6560/FLAGc6f77cc05 [2021-12-16 08:48:49,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3595a4a4f/2b3bdb59b24c474bb2d2bbcdd0fc6560 [2021-12-16 08:48:49,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:48:49,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:48:49,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:48:49,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:48:49,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:48:49,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:48:49" (1/1) ... [2021-12-16 08:48:49,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422f697e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:49, skipping insertion in model container [2021-12-16 08:48:49,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:48:49" (1/1) ... [2021-12-16 08:48:49,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:48:49,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:48:49,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-12-16 08:48:49,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-12-16 08:48:49,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-12-16 08:48:49,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:48:49,935 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-16 08:48:49,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:48:49,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-12-16 08:48:50,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-12-16 08:48:50,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-12-16 08:48:50,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:48:50,065 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 08:48:50,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[33021,33034] [2021-12-16 08:48:50,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44124,44137] [2021-12-16 08:48:50,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i[44245,44258] [2021-12-16 08:48:50,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:48:50,166 INFO L208 MainTranslator]: Completed translation [2021-12-16 08:48:50,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50 WrapperNode [2021-12-16 08:48:50,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:48:50,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 08:48:50,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 08:48:50,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 08:48:50,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,270 INFO L137 Inliner]: procedures = 179, calls = 277, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1011 [2021-12-16 08:48:50,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 08:48:50,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 08:48:50,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 08:48:50,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 08:48:50,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 08:48:50,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 08:48:50,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 08:48:50,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 08:48:50,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (1/1) ... [2021-12-16 08:48:50,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:48:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 08:48:50,412 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) [2021-12-16 08:48:50,434 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 [2021-12-16 08:48:50,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-16 08:48:50,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-16 08:48:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 08:48:50,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 08:48:50,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 08:48:50,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 08:48:50,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 08:48:50,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 08:48:50,636 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 08:48:50,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 08:48:50,640 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-16 08:48:53,585 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 08:48:53,593 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 08:48:53,593 INFO L301 CfgBuilder]: Removed 63 assume(true) statements. [2021-12-16 08:48:53,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:48:53 BoogieIcfgContainer [2021-12-16 08:48:53,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 08:48:53,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 08:48:53,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 08:48:53,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 08:48:53,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:48:49" (1/3) ... [2021-12-16 08:48:53,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0ba40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:48:53, skipping insertion in model container [2021-12-16 08:48:53,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:48:50" (2/3) ... [2021-12-16 08:48:53,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0ba40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:48:53, skipping insertion in model container [2021-12-16 08:48:53,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:48:53" (3/3) ... [2021-12-16 08:48:53,601 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2021-12-16 08:48:53,604 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 08:48:53,604 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 530 error locations. [2021-12-16 08:48:53,632 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 08:48:53,636 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 08:48:53,636 INFO L340 AbstractCegarLoop]: Starting to check reachability of 530 error locations. [2021-12-16 08:48:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 1050 states, 518 states have (on average 2.2548262548262548) internal successors, (1168), 1045 states have internal predecessors, (1168), 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) [2021-12-16 08:48:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:48:53,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:48:53,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:48:53,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:48:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:48:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2021-12-16 08:48:53,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:48:53,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671039746] [2021-12-16 08:48:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:48:53,679 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:48:53,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:48:53,680 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) [2021-12-16 08:48:53,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 08:48:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:48:53,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:48:53,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:48:53,852 INFO L388 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 [2021-12-16 08:48:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:48:53,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:48:53,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:48:53,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671039746] [2021-12-16 08:48:53,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671039746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:48:53,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:48:53,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:48:53,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728674545] [2021-12-16 08:48:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:48:53,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:48:53,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:48:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:48:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:48:53,915 INFO L87 Difference]: Start difference. First operand has 1050 states, 518 states have (on average 2.2548262548262548) internal successors, (1168), 1045 states have internal predecessors, (1168), 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) 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) [2021-12-16 08:48:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:48:55,088 INFO L93 Difference]: Finished difference Result 1041 states and 1096 transitions. [2021-12-16 08:48:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:48:55,090 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 [2021-12-16 08:48:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:48:55,101 INFO L225 Difference]: With dead ends: 1041 [2021-12-16 08:48:55,101 INFO L226 Difference]: Without dead ends: 1039 [2021-12-16 08:48:55,102 INFO L932 BasicCegarLoop]: 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 [2021-12-16 08:48:55,104 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 969 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:48:55,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 670 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-16 08:48:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-12-16 08:48:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1031. [2021-12-16 08:48:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 516 states have (on average 2.0949612403100777) internal successors, (1081), 1026 states have internal predecessors, (1081), 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) [2021-12-16 08:48:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1087 transitions. [2021-12-16 08:48:55,167 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1087 transitions. Word has length 3 [2021-12-16 08:48:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:48:55,168 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1087 transitions. [2021-12-16 08:48:55,168 INFO L471 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) [2021-12-16 08:48:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1087 transitions. [2021-12-16 08:48:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:48:55,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:48:55,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:48:55,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-16 08:48:55,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:48:55,379 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:48:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:48:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2021-12-16 08:48:55,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:48:55,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564057397] [2021-12-16 08:48:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:48:55,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:48:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:48:55,381 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) [2021-12-16 08:48:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 08:48:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:48:55,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:48:55,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:48:55,494 INFO L388 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 [2021-12-16 08:48:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:48:55,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:48:55,504 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:48:55,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564057397] [2021-12-16 08:48:55,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564057397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:48:55,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:48:55,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:48:55,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432302144] [2021-12-16 08:48:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:48:55,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:48:55,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:48:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:48:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:48:55,512 INFO L87 Difference]: Start difference. First operand 1031 states and 1087 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) [2021-12-16 08:48:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:48:57,475 INFO L93 Difference]: Finished difference Result 1421 states and 1506 transitions. [2021-12-16 08:48:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:48:57,476 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 [2021-12-16 08:48:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:48:57,482 INFO L225 Difference]: With dead ends: 1421 [2021-12-16 08:48:57,482 INFO L226 Difference]: Without dead ends: 1421 [2021-12-16 08:48:57,482 INFO L932 BasicCegarLoop]: 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 [2021-12-16 08:48:57,483 INFO L933 BasicCegarLoop]: 898 mSDtfsCounter, 419 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-16 08:48:57,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 1462 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-16 08:48:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2021-12-16 08:48:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1232. [2021-12-16 08:48:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 718 states have (on average 2.0807799442896937) internal successors, (1494), 1227 states have internal predecessors, (1494), 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) [2021-12-16 08:48:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1500 transitions. [2021-12-16 08:48:57,505 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1500 transitions. Word has length 3 [2021-12-16 08:48:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:48:57,506 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1500 transitions. [2021-12-16 08:48:57,506 INFO L471 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) [2021-12-16 08:48:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1500 transitions. [2021-12-16 08:48:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 08:48:57,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:48:57,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:48:57,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-16 08:48:57,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:48:57,715 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:48:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:48:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2021-12-16 08:48:57,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:48:57,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042645013] [2021-12-16 08:48:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:48:57,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:48:57,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:48:57,717 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) [2021-12-16 08:48:57,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 08:48:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:48:57,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:48:57,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:48:57,842 INFO L388 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 [2021-12-16 08:48:57,847 INFO L388 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 [2021-12-16 08:48:57,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:48:57,906 INFO L388 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 [2021-12-16 08:48:57,915 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:48:57,915 INFO L388 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 14 treesize of output 14 [2021-12-16 08:48:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:48:57,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:48:57,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:48:57,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042645013] [2021-12-16 08:48:57,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042645013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:48:57,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:48:57,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:48:57,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336073539] [2021-12-16 08:48:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:48:57,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:48:57,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:48:57,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:48:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:48:57,936 INFO L87 Difference]: Start difference. First operand 1232 states and 1500 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-12-16 08:48:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:48:59,667 INFO L93 Difference]: Finished difference Result 1233 states and 1503 transitions. [2021-12-16 08:48:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:48:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2021-12-16 08:48:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:48:59,671 INFO L225 Difference]: With dead ends: 1233 [2021-12-16 08:48:59,671 INFO L226 Difference]: Without dead ends: 1233 [2021-12-16 08:48:59,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:48:59,672 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 2009 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:48:59,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2012 Valid, 377 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 08:48:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2021-12-16 08:48:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1020. [2021-12-16 08:48:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 516 states have (on average 2.0717054263565893) internal successors, (1069), 1015 states have internal predecessors, (1069), 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) [2021-12-16 08:48:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1075 transitions. [2021-12-16 08:48:59,687 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1075 transitions. Word has length 7 [2021-12-16 08:48:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:48:59,687 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 1075 transitions. [2021-12-16 08:48:59,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-12-16 08:48:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1075 transitions. [2021-12-16 08:48:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:48:59,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:48:59,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:48:59,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-16 08:48:59,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:48:59,899 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:48:59,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:48:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2021-12-16 08:48:59,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:48:59,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424857613] [2021-12-16 08:48:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:48:59,901 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:48:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:48:59,901 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) [2021-12-16 08:48:59,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 08:48:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:48:59,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:48:59,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:00,022 INFO L388 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 [2021-12-16 08:49:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:00,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:00,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424857613] [2021-12-16 08:49:00,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424857613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:00,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:00,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:49:00,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476717808] [2021-12-16 08:49:00,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:00,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:49:00,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:00,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:49:00,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:49:00,035 INFO L87 Difference]: Start difference. First operand 1020 states and 1075 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-16 08:49:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:01,388 INFO L93 Difference]: Finished difference Result 1349 states and 1433 transitions. [2021-12-16 08:49:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:49:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2021-12-16 08:49:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:01,394 INFO L225 Difference]: With dead ends: 1349 [2021-12-16 08:49:01,394 INFO L226 Difference]: Without dead ends: 1349 [2021-12-16 08:49:01,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:49:01,395 INFO L933 BasicCegarLoop]: 923 mSDtfsCounter, 973 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:01,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [976 Valid, 1165 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-16 08:49:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2021-12-16 08:49:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 973. [2021-12-16 08:49:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 516 states have (on average 1.9806201550387597) internal successors, (1022), 968 states have internal predecessors, (1022), 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) [2021-12-16 08:49:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1028 transitions. [2021-12-16 08:49:01,423 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1028 transitions. Word has length 8 [2021-12-16 08:49:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:01,424 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1028 transitions. [2021-12-16 08:49:01,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-16 08:49:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1028 transitions. [2021-12-16 08:49:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:49:01,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:01,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:01,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:01,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:01,631 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2021-12-16 08:49:01,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:01,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701695566] [2021-12-16 08:49:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:01,633 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:01,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:01,634 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) [2021-12-16 08:49:01,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 08:49:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:01,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:49:01,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:01,752 INFO L388 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 [2021-12-16 08:49:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:01,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:01,770 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:01,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701695566] [2021-12-16 08:49:01,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701695566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:01,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:01,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:49:01,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450839897] [2021-12-16 08:49:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:01,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:49:01,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:01,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:49:01,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:49:01,772 INFO L87 Difference]: Start difference. First operand 973 states and 1028 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-16 08:49:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:03,618 INFO L93 Difference]: Finished difference Result 1428 states and 1515 transitions. [2021-12-16 08:49:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:49:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2021-12-16 08:49:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:03,623 INFO L225 Difference]: With dead ends: 1428 [2021-12-16 08:49:03,623 INFO L226 Difference]: Without dead ends: 1428 [2021-12-16 08:49:03,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:49:03,623 INFO L933 BasicCegarLoop]: 1129 mSDtfsCounter, 674 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:03,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 1542 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 08:49:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-12-16 08:49:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 995. [2021-12-16 08:49:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 548 states have (on average 1.967153284671533) internal successors, (1078), 990 states have internal predecessors, (1078), 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) [2021-12-16 08:49:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1084 transitions. [2021-12-16 08:49:03,643 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1084 transitions. Word has length 8 [2021-12-16 08:49:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:03,644 INFO L470 AbstractCegarLoop]: Abstraction has 995 states and 1084 transitions. [2021-12-16 08:49:03,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-16 08:49:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1084 transitions. [2021-12-16 08:49:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 08:49:03,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:03,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:03,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:03,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:03,852 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:03,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:03,853 INFO L85 PathProgramCache]: Analyzing trace with hash 871378613, now seen corresponding path program 1 times [2021-12-16 08:49:03,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:03,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555581459] [2021-12-16 08:49:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:03,856 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:03,857 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) [2021-12-16 08:49:03,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 08:49:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:03,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 08:49:03,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:04,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:04,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:04,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555581459] [2021-12-16 08:49:04,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555581459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:04,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:04,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:04,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179562583] [2021-12-16 08:49:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:04,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:04,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:04,008 INFO L87 Difference]: Start difference. First operand 995 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-16 08:49:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:04,468 INFO L93 Difference]: Finished difference Result 1446 states and 1568 transitions. [2021-12-16 08:49:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:49:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-16 08:49:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:04,472 INFO L225 Difference]: With dead ends: 1446 [2021-12-16 08:49:04,472 INFO L226 Difference]: Without dead ends: 1446 [2021-12-16 08:49:04,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:04,473 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 548 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:04,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 2925 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 08:49:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-12-16 08:49:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1236. [2021-12-16 08:49:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 789 states have (on average 1.944233206590621) internal successors, (1534), 1231 states have internal predecessors, (1534), 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) [2021-12-16 08:49:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1540 transitions. [2021-12-16 08:49:04,490 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1540 transitions. Word has length 11 [2021-12-16 08:49:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:04,491 INFO L470 AbstractCegarLoop]: Abstraction has 1236 states and 1540 transitions. [2021-12-16 08:49:04,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-16 08:49:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1540 transitions. [2021-12-16 08:49:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 08:49:04,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:04,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:04,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:04,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:04,699 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr529ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1242933253, now seen corresponding path program 1 times [2021-12-16 08:49:04,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:04,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239630246] [2021-12-16 08:49:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:04,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:04,702 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) [2021-12-16 08:49:04,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 08:49:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:04,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:49:04,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:04,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:49:04,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:49:04,881 INFO L354 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2021-12-16 08:49:04,881 INFO L388 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 3 case distinctions, treesize of input 29 treesize of output 36 [2021-12-16 08:49:04,911 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-16 08:49:04,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2021-12-16 08:49:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:04,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:04,944 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:04,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239630246] [2021-12-16 08:49:04,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239630246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:04,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:04,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:04,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584193691] [2021-12-16 08:49:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:04,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:04,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:04,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:04,945 INFO L87 Difference]: Start difference. First operand 1236 states and 1540 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-16 08:49:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:05,777 INFO L93 Difference]: Finished difference Result 1592 states and 1955 transitions. [2021-12-16 08:49:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:49:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-12-16 08:49:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:05,781 INFO L225 Difference]: With dead ends: 1592 [2021-12-16 08:49:05,782 INFO L226 Difference]: Without dead ends: 1592 [2021-12-16 08:49:05,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:05,782 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 352 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:05,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 2835 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 48 Unchecked, 0.8s Time] [2021-12-16 08:49:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2021-12-16 08:49:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1235. [2021-12-16 08:49:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 788 states have (on average 1.9441624365482233) internal successors, (1532), 1230 states have internal predecessors, (1532), 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) [2021-12-16 08:49:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1538 transitions. [2021-12-16 08:49:05,797 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1538 transitions. Word has length 12 [2021-12-16 08:49:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:05,798 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1538 transitions. [2021-12-16 08:49:05,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-16 08:49:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1538 transitions. [2021-12-16 08:49:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 08:49:05,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:05,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:05,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-16 08:49:06,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:06,006 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:06,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2021-12-16 08:49:06,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:06,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454144723] [2021-12-16 08:49:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:06,007 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:06,008 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) [2021-12-16 08:49:06,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 08:49:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:06,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 08:49:06,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:06,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:06,151 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:06,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454144723] [2021-12-16 08:49:06,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454144723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:06,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:06,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:49:06,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42607330] [2021-12-16 08:49:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:06,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:49:06,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:49:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:49:06,152 INFO L87 Difference]: Start difference. First operand 1235 states and 1538 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-16 08:49:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:06,172 INFO L93 Difference]: Finished difference Result 1175 states and 1452 transitions. [2021-12-16 08:49:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:49:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2021-12-16 08:49:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:06,175 INFO L225 Difference]: With dead ends: 1175 [2021-12-16 08:49:06,175 INFO L226 Difference]: Without dead ends: 1175 [2021-12-16 08:49:06,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:49:06,176 INFO L933 BasicCegarLoop]: 971 mSDtfsCounter, 955 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:06,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [958 Valid, 993 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:49:06,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-12-16 08:49:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2021-12-16 08:49:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 752 states have (on average 1.922872340425532) internal successors, (1446), 1170 states have internal predecessors, (1446), 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) [2021-12-16 08:49:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1452 transitions. [2021-12-16 08:49:06,189 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1452 transitions. Word has length 18 [2021-12-16 08:49:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:06,189 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 1452 transitions. [2021-12-16 08:49:06,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2021-12-16 08:49:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1452 transitions. [2021-12-16 08:49:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 08:49:06,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:06,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:06,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:06,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:06,398 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2021-12-16 08:49:06,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:06,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879839010] [2021-12-16 08:49:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:06,399 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:06,400 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) [2021-12-16 08:49:06,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-16 08:49:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:06,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:49:06,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:06,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:06,549 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879839010] [2021-12-16 08:49:06,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879839010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:06,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:06,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:06,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337016489] [2021-12-16 08:49:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:06,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:06,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:06,550 INFO L87 Difference]: Start difference. First operand 1175 states and 1452 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-12-16 08:49:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:06,594 INFO L93 Difference]: Finished difference Result 1147 states and 1396 transitions. [2021-12-16 08:49:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:49:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2021-12-16 08:49:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:06,597 INFO L225 Difference]: With dead ends: 1147 [2021-12-16 08:49:06,598 INFO L226 Difference]: Without dead ends: 1147 [2021-12-16 08:49:06,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:06,598 INFO L933 BasicCegarLoop]: 926 mSDtfsCounter, 926 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:06,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 1867 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:49:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-12-16 08:49:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1145. [2021-12-16 08:49:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 736 states have (on average 1.8858695652173914) internal successors, (1388), 1140 states have internal predecessors, (1388), 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) [2021-12-16 08:49:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1394 transitions. [2021-12-16 08:49:06,611 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1394 transitions. Word has length 20 [2021-12-16 08:49:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:06,611 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 1394 transitions. [2021-12-16 08:49:06,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-12-16 08:49:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1394 transitions. [2021-12-16 08:49:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:49:06,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:06,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:06,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:06,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:06,819 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2021-12-16 08:49:06,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669427300] [2021-12-16 08:49:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:06,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:06,822 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) [2021-12-16 08:49:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-16 08:49:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:06,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:49:06,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:06,972 INFO L388 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 [2021-12-16 08:49:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:07,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:07,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:07,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669427300] [2021-12-16 08:49:07,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669427300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:07,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:07,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:49:07,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412999422] [2021-12-16 08:49:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:07,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:07,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:07,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:07,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:07,035 INFO L87 Difference]: Start difference. First operand 1145 states and 1394 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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) [2021-12-16 08:49:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:08,403 INFO L93 Difference]: Finished difference Result 1606 states and 1976 transitions. [2021-12-16 08:49:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:49:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2021-12-16 08:49:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:08,407 INFO L225 Difference]: With dead ends: 1606 [2021-12-16 08:49:08,407 INFO L226 Difference]: Without dead ends: 1606 [2021-12-16 08:49:08,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:08,408 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 1679 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:08,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1679 Valid, 1004 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-16 08:49:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-12-16 08:49:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1141. [2021-12-16 08:49:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 736 states have (on average 1.875) internal successors, (1380), 1136 states have internal predecessors, (1380), 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) [2021-12-16 08:49:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1386 transitions. [2021-12-16 08:49:08,419 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1386 transitions. Word has length 34 [2021-12-16 08:49:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:08,420 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 1386 transitions. [2021-12-16 08:49:08,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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) [2021-12-16 08:49:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1386 transitions. [2021-12-16 08:49:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:49:08,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:08,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:08,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:08,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:08,627 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2021-12-16 08:49:08,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:08,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480654437] [2021-12-16 08:49:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:08,628 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:08,629 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) [2021-12-16 08:49:08,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 08:49:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:08,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 08:49:08,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:08,769 INFO L388 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 [2021-12-16 08:49:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:08,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:08,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:08,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480654437] [2021-12-16 08:49:08,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480654437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:08,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:08,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:49:08,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028782696] [2021-12-16 08:49:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:08,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:08,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:08,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:08,901 INFO L87 Difference]: Start difference. First operand 1141 states and 1386 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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) [2021-12-16 08:49:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:11,015 INFO L93 Difference]: Finished difference Result 1742 states and 2136 transitions. [2021-12-16 08:49:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:49:11,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2021-12-16 08:49:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:11,019 INFO L225 Difference]: With dead ends: 1742 [2021-12-16 08:49:11,019 INFO L226 Difference]: Without dead ends: 1742 [2021-12-16 08:49:11,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:11,020 INFO L933 BasicCegarLoop]: 1175 mSDtfsCounter, 1158 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:11,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1158 Valid, 2013 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-16 08:49:11,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2021-12-16 08:49:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1137. [2021-12-16 08:49:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 736 states have (on average 1.8641304347826086) internal successors, (1372), 1132 states have internal predecessors, (1372), 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) [2021-12-16 08:49:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1378 transitions. [2021-12-16 08:49:11,032 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1378 transitions. Word has length 34 [2021-12-16 08:49:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:11,032 INFO L470 AbstractCegarLoop]: Abstraction has 1137 states and 1378 transitions. [2021-12-16 08:49:11,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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) [2021-12-16 08:49:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1378 transitions. [2021-12-16 08:49:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-16 08:49:11,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:11,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:11,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:11,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:11,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2021-12-16 08:49:11,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:11,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549920012] [2021-12-16 08:49:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:11,243 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:11,244 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) [2021-12-16 08:49:11,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 08:49:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:49:11,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:11,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:11,500 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549920012] [2021-12-16 08:49:11,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549920012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:11,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:11,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:11,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303549559] [2021-12-16 08:49:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:11,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:11,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:11,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:11,501 INFO L87 Difference]: Start difference. First operand 1137 states and 1378 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2021-12-16 08:49:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:11,547 INFO L93 Difference]: Finished difference Result 1125 states and 1358 transitions. [2021-12-16 08:49:11,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:49:11,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2021-12-16 08:49:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:11,550 INFO L225 Difference]: With dead ends: 1125 [2021-12-16 08:49:11,550 INFO L226 Difference]: Without dead ends: 1125 [2021-12-16 08:49:11,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:11,551 INFO L933 BasicCegarLoop]: 920 mSDtfsCounter, 902 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:11,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [905 Valid, 1845 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:49:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-12-16 08:49:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2021-12-16 08:49:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 724 states have (on average 1.867403314917127) internal successors, (1352), 1120 states have internal predecessors, (1352), 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) [2021-12-16 08:49:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1358 transitions. [2021-12-16 08:49:11,562 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1358 transitions. Word has length 52 [2021-12-16 08:49:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:11,562 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1358 transitions. [2021-12-16 08:49:11,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2021-12-16 08:49:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1358 transitions. [2021-12-16 08:49:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 08:49:11,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:11,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:11,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-16 08:49:11,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:11,773 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2021-12-16 08:49:11,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781791762] [2021-12-16 08:49:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:11,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:11,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:11,775 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) [2021-12-16 08:49:11,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 08:49:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:12,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:49:12,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:12,041 INFO L388 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 [2021-12-16 08:49:12,045 INFO L388 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 [2021-12-16 08:49:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:49:12,437 INFO L388 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 [2021-12-16 08:49:12,452 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:49:12,453 INFO L388 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 14 treesize of output 14 [2021-12-16 08:49:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:12,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:12,463 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781791762] [2021-12-16 08:49:12,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781791762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:12,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:12,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:49:12,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436396549] [2021-12-16 08:49:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:12,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:12,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:12,464 INFO L87 Difference]: Start difference. First operand 1125 states and 1358 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2021-12-16 08:49:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:14,212 INFO L93 Difference]: Finished difference Result 1537 states and 1895 transitions. [2021-12-16 08:49:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:49:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-12-16 08:49:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:14,217 INFO L225 Difference]: With dead ends: 1537 [2021-12-16 08:49:14,217 INFO L226 Difference]: Without dead ends: 1537 [2021-12-16 08:49:14,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:14,217 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 2043 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2046 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:14,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2046 Valid, 462 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 08:49:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2021-12-16 08:49:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1055. [2021-12-16 08:49:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 692 states have (on average 1.8034682080924855) internal successors, (1248), 1050 states have internal predecessors, (1248), 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) [2021-12-16 08:49:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1254 transitions. [2021-12-16 08:49:14,228 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1254 transitions. Word has length 60 [2021-12-16 08:49:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:14,228 INFO L470 AbstractCegarLoop]: Abstraction has 1055 states and 1254 transitions. [2021-12-16 08:49:14,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2021-12-16 08:49:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1254 transitions. [2021-12-16 08:49:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:49:14,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:14,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:14,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:14,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:14,438 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2021-12-16 08:49:14,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:14,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522798859] [2021-12-16 08:49:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:14,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:14,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:14,440 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) [2021-12-16 08:49:14,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 08:49:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:14,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:49:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:14,720 INFO L388 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 [2021-12-16 08:49:14,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:49:14,750 INFO L388 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 24 treesize of output 12 [2021-12-16 08:49:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:14,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:14,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522798859] [2021-12-16 08:49:14,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522798859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:14,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:14,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:14,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683851482] [2021-12-16 08:49:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:14,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:49:14,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:49:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:14,759 INFO L87 Difference]: Start difference. First operand 1055 states and 1254 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:49:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:16,221 INFO L93 Difference]: Finished difference Result 1054 states and 1253 transitions. [2021-12-16 08:49:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:49:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2021-12-16 08:49:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:16,225 INFO L225 Difference]: With dead ends: 1054 [2021-12-16 08:49:16,225 INFO L226 Difference]: Without dead ends: 1054 [2021-12-16 08:49:16,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 08:49:16,225 INFO L933 BasicCegarLoop]: 880 mSDtfsCounter, 4 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:16,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2237 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-16 08:49:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-12-16 08:49:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2021-12-16 08:49:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 692 states have (on average 1.8020231213872833) internal successors, (1247), 1049 states have internal predecessors, (1247), 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) [2021-12-16 08:49:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1253 transitions. [2021-12-16 08:49:16,234 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1253 transitions. Word has length 65 [2021-12-16 08:49:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:16,235 INFO L470 AbstractCegarLoop]: Abstraction has 1054 states and 1253 transitions. [2021-12-16 08:49:16,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:49:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1253 transitions. [2021-12-16 08:49:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:49:16,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:16,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:16,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:16,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:16,445 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2021-12-16 08:49:16,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:16,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973240574] [2021-12-16 08:49:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:16,446 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:16,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:16,447 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) [2021-12-16 08:49:16,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 08:49:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:16,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 08:49:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:16,715 INFO L388 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 [2021-12-16 08:49:16,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:49:16,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:49:16,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-16 08:49:16,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 08:49:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:16,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:16,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:16,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973240574] [2021-12-16 08:49:16,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973240574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:16,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:16,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:16,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155581307] [2021-12-16 08:49:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:16,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:49:16,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:49:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:16,792 INFO L87 Difference]: Start difference. First operand 1054 states and 1253 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:49:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:18,894 INFO L93 Difference]: Finished difference Result 1053 states and 1252 transitions. [2021-12-16 08:49:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:49:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2021-12-16 08:49:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:18,897 INFO L225 Difference]: With dead ends: 1053 [2021-12-16 08:49:18,898 INFO L226 Difference]: Without dead ends: 1053 [2021-12-16 08:49:18,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 08:49:18,898 INFO L933 BasicCegarLoop]: 880 mSDtfsCounter, 2 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:18,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2278 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-16 08:49:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-12-16 08:49:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2021-12-16 08:49:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 691 states have (on average 1.8031837916063675) internal successors, (1246), 1048 states have internal predecessors, (1246), 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) [2021-12-16 08:49:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1252 transitions. [2021-12-16 08:49:18,909 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1252 transitions. Word has length 65 [2021-12-16 08:49:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:18,909 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 1252 transitions. [2021-12-16 08:49:18,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:49:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1252 transitions. [2021-12-16 08:49:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-16 08:49:18,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:18,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:18,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:19,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:19,119 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1702947151, now seen corresponding path program 1 times [2021-12-16 08:49:19,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:19,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113699395] [2021-12-16 08:49:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:19,120 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:19,121 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) [2021-12-16 08:49:19,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 08:49:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:19,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:49:19,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:19,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:49:19,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:19,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113699395] [2021-12-16 08:49:19,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113699395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:49:19,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:49:19,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:49:19,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789413017] [2021-12-16 08:49:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:49:19,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:49:19,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:49:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:49:19,419 INFO L87 Difference]: Start difference. First operand 1053 states and 1252 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-12-16 08:49:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:19,453 INFO L93 Difference]: Finished difference Result 1056 states and 1256 transitions. [2021-12-16 08:49:19,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:49:19,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 [2021-12-16 08:49:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:19,458 INFO L225 Difference]: With dead ends: 1056 [2021-12-16 08:49:19,458 INFO L226 Difference]: Without dead ends: 1056 [2021-12-16 08:49:19,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:49:19,459 INFO L933 BasicCegarLoop]: 880 mSDtfsCounter, 2 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:19,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2635 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:49:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2021-12-16 08:49:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2021-12-16 08:49:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 693 states have (on average 1.8023088023088023) internal successors, (1249), 1051 states have internal predecessors, (1249), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 08:49:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1256 transitions. [2021-12-16 08:49:19,473 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1256 transitions. Word has length 73 [2021-12-16 08:49:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:19,473 INFO L470 AbstractCegarLoop]: Abstraction has 1056 states and 1256 transitions. [2021-12-16 08:49:19,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-12-16 08:49:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1256 transitions. [2021-12-16 08:49:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-16 08:49:19,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:19,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:19,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:19,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:19,684 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2021354046, now seen corresponding path program 1 times [2021-12-16 08:49:19,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:19,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089677332] [2021-12-16 08:49:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:49:19,686 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:19,687 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) [2021-12-16 08:49:19,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 08:49:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:49:19,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:49:19,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:19,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:49:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:20,128 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:20,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089677332] [2021-12-16 08:49:20,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089677332] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:49:20,129 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:49:20,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-16 08:49:20,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713255346] [2021-12-16 08:49:20,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:49:20,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 08:49:20,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:20,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 08:49:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 08:49:20,131 INFO L87 Difference]: Start difference. First operand 1056 states and 1256 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:20,243 INFO L93 Difference]: Finished difference Result 1068 states and 1273 transitions. [2021-12-16 08:49:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 08:49:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2021-12-16 08:49:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:20,247 INFO L225 Difference]: With dead ends: 1068 [2021-12-16 08:49:20,248 INFO L226 Difference]: Without dead ends: 1068 [2021-12-16 08:49:20,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-12-16 08:49:20,249 INFO L933 BasicCegarLoop]: 881 mSDtfsCounter, 23 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:20,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 2638 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 08:49:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-12-16 08:49:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1066. [2021-12-16 08:49:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 702 states have (on average 1.8005698005698005) internal successors, (1264), 1060 states have internal predecessors, (1264), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 08:49:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1271 transitions. [2021-12-16 08:49:20,262 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1271 transitions. Word has length 74 [2021-12-16 08:49:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:20,262 INFO L470 AbstractCegarLoop]: Abstraction has 1066 states and 1271 transitions. [2021-12-16 08:49:20,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1271 transitions. [2021-12-16 08:49:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-16 08:49:20,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:20,267 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:20,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:20,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:20,481 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1623069169, now seen corresponding path program 2 times [2021-12-16 08:49:20,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:20,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578269216] [2021-12-16 08:49:20,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 08:49:20,482 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:20,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:20,483 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) [2021-12-16 08:49:20,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 08:49:20,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 08:49:20,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:49:20,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:49:20,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:20,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:49:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:21,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:21,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578269216] [2021-12-16 08:49:21,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578269216] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:49:21,182 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:49:21,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-16 08:49:21,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297773406] [2021-12-16 08:49:21,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:49:21,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 08:49:21,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:21,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 08:49:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-16 08:49:21,184 INFO L87 Difference]: Start difference. First operand 1066 states and 1271 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:21,644 INFO L93 Difference]: Finished difference Result 1087 states and 1299 transitions. [2021-12-16 08:49:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 08:49:21,645 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2021-12-16 08:49:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:21,647 INFO L225 Difference]: With dead ends: 1087 [2021-12-16 08:49:21,648 INFO L226 Difference]: Without dead ends: 1083 [2021-12-16 08:49:21,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-16 08:49:21,648 INFO L933 BasicCegarLoop]: 884 mSDtfsCounter, 68 mSDsluCounter, 5279 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 6163 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:21,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 6163 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 08:49:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-12-16 08:49:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1075. [2021-12-16 08:49:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 711 states have (on average 1.7946554149085794) internal successors, (1276), 1069 states have internal predecessors, (1276), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 08:49:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1283 transitions. [2021-12-16 08:49:21,659 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1283 transitions. Word has length 77 [2021-12-16 08:49:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:21,659 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 1283 transitions. [2021-12-16 08:49:21,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1283 transitions. [2021-12-16 08:49:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 08:49:21,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:21,660 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:21,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:21,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:21,871 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -568082129, now seen corresponding path program 3 times [2021-12-16 08:49:21,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:21,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072238217] [2021-12-16 08:49:21,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 08:49:21,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:21,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:21,873 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) [2021-12-16 08:49:21,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-16 08:49:22,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-16 08:49:22,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:49:22,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 08:49:22,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:22,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:49:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:23,185 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072238217] [2021-12-16 08:49:23,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072238217] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:49:23,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:49:23,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-16 08:49:23,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467213242] [2021-12-16 08:49:23,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:49:23,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 08:49:23,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 08:49:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-16 08:49:23,187 INFO L87 Difference]: Start difference. First operand 1075 states and 1283 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:25,603 INFO L93 Difference]: Finished difference Result 1117 states and 1345 transitions. [2021-12-16 08:49:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-16 08:49:25,604 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2021-12-16 08:49:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:25,607 INFO L225 Difference]: With dead ends: 1117 [2021-12-16 08:49:25,607 INFO L226 Difference]: Without dead ends: 1111 [2021-12-16 08:49:25,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-16 08:49:25,608 INFO L933 BasicCegarLoop]: 889 mSDtfsCounter, 138 mSDsluCounter, 14105 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 14994 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:25,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 14994 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 08:49:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-12-16 08:49:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1093. [2021-12-16 08:49:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 729 states have (on average 1.7818930041152263) internal successors, (1299), 1087 states have internal predecessors, (1299), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 08:49:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1306 transitions. [2021-12-16 08:49:25,619 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1306 transitions. Word has length 83 [2021-12-16 08:49:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:25,619 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1306 transitions. [2021-12-16 08:49:25,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1306 transitions. [2021-12-16 08:49:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-16 08:49:25,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:25,620 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:25,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:25,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:25,830 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash -738140305, now seen corresponding path program 4 times [2021-12-16 08:49:25,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289132895] [2021-12-16 08:49:25,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 08:49:25,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:25,832 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) [2021-12-16 08:49:25,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-16 08:49:26,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 08:49:26,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:49:26,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 08:49:26,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:26,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:49:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:49:27,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:27,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289132895] [2021-12-16 08:49:27,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289132895] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:49:27,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:49:27,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-16 08:49:27,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251772565] [2021-12-16 08:49:27,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:49:27,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-16 08:49:27,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:49:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-16 08:49:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-16 08:49:27,749 INFO L87 Difference]: Start difference. First operand 1093 states and 1306 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:49:37,467 INFO L93 Difference]: Finished difference Result 1173 states and 1418 transitions. [2021-12-16 08:49:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-16 08:49:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2021-12-16 08:49:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:49:37,471 INFO L225 Difference]: With dead ends: 1173 [2021-12-16 08:49:37,471 INFO L226 Difference]: Without dead ends: 1169 [2021-12-16 08:49:37,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-16 08:49:37,474 INFO L933 BasicCegarLoop]: 901 mSDtfsCounter, 413 mSDsluCounter, 20636 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 21537 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:49:37,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 21537 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-16 08:49:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-16 08:49:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1127. [2021-12-16 08:49:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 763 states have (on average 1.7627785058977719) internal successors, (1345), 1121 states have internal predecessors, (1345), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-16 08:49:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1352 transitions. [2021-12-16 08:49:37,506 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1352 transitions. Word has length 95 [2021-12-16 08:49:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:49:37,506 INFO L470 AbstractCegarLoop]: Abstraction has 1127 states and 1352 transitions. [2021-12-16 08:49:37,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:49:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1352 transitions. [2021-12-16 08:49:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-16 08:49:37,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:49:37,507 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:49:37,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 08:49:37,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:49:37,719 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 526 more)] === [2021-12-16 08:49:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:49:37,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1195934321, now seen corresponding path program 5 times [2021-12-16 08:49:37,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:49:37,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137279724] [2021-12-16 08:49:37,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:49:37,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:49:37,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:49:37,721 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) [2021-12-16 08:49:37,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-16 08:49:38,898 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-16 08:49:38,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:49:38,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 110 conjunts are in the unsatisfiable core [2021-12-16 08:49:38,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:49:38,951 INFO L388 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 [2021-12-16 08:49:39,178 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:49:39,178 INFO L388 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 14 treesize of output 14 [2021-12-16 08:49:39,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 08:49:39,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:49:39,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:49:39,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-16 08:49:39,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-16 08:49:39,367 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1878 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1878))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1879)))) is different from true [2021-12-16 08:49:39,376 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1881))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1880)))) is different from true [2021-12-16 08:49:39,388 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1883))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1882)))) is different from true [2021-12-16 08:49:39,436 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1886))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1887)))) is different from true [2021-12-16 08:49:39,449 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1888))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1889)))) is different from true [2021-12-16 08:49:39,462 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1891))) (exists ((v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1890)))) is different from true [2021-12-16 08:49:39,477 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1892))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1893 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1893)))) is different from true [2021-12-16 08:49:39,489 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1895))) (exists ((v_ArrVal_1894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1894))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,504 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1897))) (exists ((v_ArrVal_1896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1896))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,514 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1898))) (exists ((v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1899))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,525 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1900))) (exists ((v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1901)))) is different from true [2021-12-16 08:49:39,534 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1902))) (exists ((v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1903)))) is different from true [2021-12-16 08:49:39,544 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1905))) (exists ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1904))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,592 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1909))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908)))) is different from true [2021-12-16 08:49:39,604 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911)))) is different from true [2021-12-16 08:49:39,616 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912)))) is different from true [2021-12-16 08:49:39,628 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914)))) is different from true [2021-12-16 08:49:39,639 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917)))) is different from true [2021-12-16 08:49:39,650 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918)))) is different from true [2021-12-16 08:49:39,659 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,670 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922))) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,680 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925)))) is different from true [2021-12-16 08:49:39,689 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,700 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928)))) is different from true [2021-12-16 08:49:39,711 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930)))) is different from true [2021-12-16 08:49:39,722 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933))) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932)))) is different from true [2021-12-16 08:49:39,733 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934)))) is different from true [2021-12-16 08:49:39,743 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,755 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939)))) is different from true [2021-12-16 08:49:39,766 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940)))) is different from true [2021-12-16 08:49:39,777 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,788 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,799 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947)))) is different from true [2021-12-16 08:49:39,809 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949)))) is different from true [2021-12-16 08:49:39,819 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950)))) is different from true [2021-12-16 08:49:39,830 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953)))) is different from true [2021-12-16 08:49:39,841 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:49:39,853 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957)))) is different from true [2021-12-16 08:49:39,863 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959)))) is different from true [2021-12-16 08:49:39,874 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961)))) is different from true [2021-12-16 08:49:39,890 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962))) (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963)))) is different from true [2021-12-16 08:49:39,900 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965)))) is different from true [2021-12-16 08:49:39,934 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 08:49:39,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-16 08:49:39,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 08:49:39,976 INFO L388 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 15 treesize of output 7 [2021-12-16 08:49:39,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 08:49:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2021-12-16 08:49:40,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:49:40,613 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2056 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2056 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-16 08:49:40,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:49:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137279724] [2021-12-16 08:49:40,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137279724] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 08:49:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2099363219] [2021-12-16 08:49:40,618 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:49:40,618 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-16 08:49:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-16 08:49:40,620 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-16 08:49:40,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process