./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.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_JEN_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:51:04,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:51:04,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:51:04,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:51:04,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:51:04,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:51:04,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:51:04,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:51:04,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:51:04,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:51:04,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:51:04,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:51:04,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:51:04,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:51:04,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:51:04,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:51:04,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:51:04,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:51:04,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:51:04,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:51:04,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:51:04,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:51:04,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:51:04,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:51:04,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:51:05,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:51:05,001 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:51:05,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:51:05,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:51:05,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:51:05,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:51:05,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:51:05,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:51:05,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:51:05,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:51:05,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:51:05,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:51:05,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:51:05,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:51:05,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:51:05,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:51:05,011 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:51:05,034 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:51:05,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:51:05,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:51:05,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:51:05,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:51:05,036 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:51:05,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:51:05,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:51:05,036 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:51:05,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:51:05,037 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:51:05,038 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:51:05,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:51:05,039 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:51:05,039 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:51:05,039 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:51:05,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:51:05,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:51:05,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:51:05,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:51:05,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:51:05,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:51:05,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 08:51:05,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 08:51:05,040 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:51:05,040 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 -> 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d [2021-12-16 08:51:05,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:51:05,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:51:05,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:51:05,279 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:51:05,282 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:51:05,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2021-12-16 08:51:05,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761101d8/81d603918c3749f0a1e541cf3c8319bf/FLAGede5f0cdc [2021-12-16 08:51:05,783 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:51:05,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2021-12-16 08:51:05,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761101d8/81d603918c3749f0a1e541cf3c8319bf/FLAGede5f0cdc [2021-12-16 08:51:06,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761101d8/81d603918c3749f0a1e541cf3c8319bf [2021-12-16 08:51:06,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:51:06,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:51:06,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:51:06,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:51:06,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:51:06,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:51:06" (1/1) ... [2021-12-16 08:51:06,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f1e2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:06, skipping insertion in model container [2021-12-16 08:51:06,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:51:06" (1/1) ... [2021-12-16 08:51:06,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:51:06,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:51:06,508 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_JEN_test7-2.i[33021,33034] [2021-12-16 08:51:06,587 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_JEN_test7-2.i[44124,44137] [2021-12-16 08:51:06,592 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_JEN_test7-2.i[44245,44258] [2021-12-16 08:51:06,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:51:06,610 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:51:06,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48cc3b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:06, skipping insertion in model container [2021-12-16 08:51:06,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:51:06,611 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-16 08:51:06,612 INFO L158 Benchmark]: Toolchain (without parser) took 501.98ms. Allocated memory is still 96.5MB. Free memory was 65.1MB in the beginning and 61.5MB in the end (delta: 3.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 08:51:06,613 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 08:51:06,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.12ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 61.5MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 08:51:06,614 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.7MB in the beginning and 53.7MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.12ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 61.5MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. 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_JEN_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:51:08,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:51:08,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:51:08,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:51:08,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:51:08,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:51:08,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:51:08,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:51:08,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:51:08,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:51:08,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:51:08,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:51:08,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:51:08,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:51:08,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:51:08,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:51:08,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:51:08,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:51:08,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:51:08,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:51:08,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:51:08,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:51:08,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:51:08,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:51:08,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:51:08,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:51:08,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:51:08,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:51:08,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:51:08,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:51:08,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:51:08,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:51:08,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:51:08,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:51:08,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:51:08,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:51:08,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:51:08,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:51:08,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:51:08,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:51:08,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:51:08,246 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:51:08,282 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:51:08,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:51:08,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:51:08,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:51:08,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:51:08,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:51:08,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:51:08,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:51:08,285 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:51:08,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:51:08,286 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:51:08,286 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:51:08,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:51:08,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:51:08,287 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 08:51:08,288 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 08:51:08,288 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:51:08,288 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:51:08,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:51:08,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:51:08,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:51:08,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:51:08,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:51:08,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:51:08,289 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 08:51:08,289 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 08:51:08,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:51:08,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 08:51:08,290 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 -> 1f8d40fc3d39b827c494ff373d43bd116589a8fd89c6e972621bd6e0216b2f6d [2021-12-16 08:51:08,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:51:08,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:51:08,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:51:08,556 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:51:08,556 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:51:08,557 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2021-12-16 08:51:08,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad72c300d/89e7d3698641406c851b9e000d4f9e70/FLAG2ffe1895b [2021-12-16 08:51:09,045 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:51:09,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-2.i [2021-12-16 08:51:09,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad72c300d/89e7d3698641406c851b9e000d4f9e70/FLAG2ffe1895b [2021-12-16 08:51:09,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad72c300d/89e7d3698641406c851b9e000d4f9e70 [2021-12-16 08:51:09,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:51:09,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:51:09,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:51:09,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:51:09,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:51:09,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:09,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c285eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09, skipping insertion in model container [2021-12-16 08:51:09,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:09,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:51:09,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:51:09,446 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_JEN_test7-2.i[33021,33034] [2021-12-16 08:51:09,548 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_JEN_test7-2.i[44124,44137] [2021-12-16 08:51:09,551 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_JEN_test7-2.i[44245,44258] [2021-12-16 08:51:09,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:51:09,583 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-16 08:51:09,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:51:09,625 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_JEN_test7-2.i[33021,33034] [2021-12-16 08:51:09,697 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_JEN_test7-2.i[44124,44137] [2021-12-16 08:51:09,697 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_JEN_test7-2.i[44245,44258] [2021-12-16 08:51:09,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:51:09,715 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 08:51:09,747 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_JEN_test7-2.i[33021,33034] [2021-12-16 08:51:09,790 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_JEN_test7-2.i[44124,44137] [2021-12-16 08:51:09,800 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_JEN_test7-2.i[44245,44258] [2021-12-16 08:51:09,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:51:09,841 INFO L208 MainTranslator]: Completed translation [2021-12-16 08:51:09,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09 WrapperNode [2021-12-16 08:51:09,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:51:09,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 08:51:09,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 08:51:09,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 08:51:09,848 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:51:09" (1/1) ... [2021-12-16 08:51:09,886 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:51:09" (1/1) ... [2021-12-16 08:51:09,963 INFO L137 Inliner]: procedures = 179, calls = 328, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1175 [2021-12-16 08:51:09,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 08:51:09,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 08:51:09,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 08:51:09,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 08:51:09,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:09,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:09,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:09,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:10,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:10,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:10,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:10,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 08:51:10,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 08:51:10,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 08:51:10,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 08:51:10,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (1/1) ... [2021-12-16 08:51:10,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:51:10,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 08:51:10,116 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:51:10,124 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:51:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-16 08:51:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 08:51:10,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-16 08:51:10,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-16 08:51:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 08:51:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 08:51:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 08:51:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 08:51:10,175 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-16 08:51:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 08:51:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 08:51:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 08:51:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 08:51:10,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 08:51:10,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 08:51:10,319 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 08:51:10,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 08:51:10,323 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-16 08:51:13,543 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 08:51:13,552 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 08:51:13,552 INFO L301 CfgBuilder]: Removed 72 assume(true) statements. [2021-12-16 08:51:13,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:51:13 BoogieIcfgContainer [2021-12-16 08:51:13,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 08:51:13,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 08:51:13,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 08:51:13,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 08:51:13,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:51:09" (1/3) ... [2021-12-16 08:51:13,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1357fbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:51:13, skipping insertion in model container [2021-12-16 08:51:13,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:09" (2/3) ... [2021-12-16 08:51:13,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1357fbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:51:13, skipping insertion in model container [2021-12-16 08:51:13,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:51:13" (3/3) ... [2021-12-16 08:51:13,560 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test7-2.i [2021-12-16 08:51:13,564 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 08:51:13,564 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 635 error locations. [2021-12-16 08:51:13,592 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 08:51:13,596 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:51:13,597 INFO L340 AbstractCegarLoop]: Starting to check reachability of 635 error locations. [2021-12-16 08:51:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 1249 states, 612 states have (on average 2.2663398692810457) internal successors, (1387), 1244 states have internal predecessors, (1387), 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:51:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:51:13,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:13,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:51:13,627 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2021-12-16 08:51:13,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:13,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683383903] [2021-12-16 08:51:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:13,639 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:13,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:13,641 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:51:13,644 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:51:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:13,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:51:13,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:13,805 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:51:13,830 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:51:13,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:13,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:13,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683383903] [2021-12-16 08:51:13,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683383903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:13,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:13,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:51:13,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911218671] [2021-12-16 08:51:13,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:13,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:51:13,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:51:13,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:51:13,856 INFO L87 Difference]: Start difference. First operand has 1249 states, 612 states have (on average 2.2663398692810457) internal successors, (1387), 1244 states have internal predecessors, (1387), 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:51:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:15,404 INFO L93 Difference]: Finished difference Result 1417 states and 1492 transitions. [2021-12-16 08:51:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:51:15,406 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:51:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:15,418 INFO L225 Difference]: With dead ends: 1417 [2021-12-16 08:51:15,419 INFO L226 Difference]: Without dead ends: 1415 [2021-12-16 08:51:15,420 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:51:15,422 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 1160 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:15,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1163 Valid, 893 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-16 08:51:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2021-12-16 08:51:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1230. [2021-12-16 08:51:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 610 states have (on average 2.1163934426229507) internal successors, (1291), 1225 states have internal predecessors, (1291), 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:51:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1297 transitions. [2021-12-16 08:51:15,476 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1297 transitions. Word has length 3 [2021-12-16 08:51:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:15,477 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1297 transitions. [2021-12-16 08:51:15,477 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:51:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1297 transitions. [2021-12-16 08:51:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:51:15,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:15,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:51:15,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-16 08:51:15,684 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:51:15,685 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2021-12-16 08:51:15,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433303772] [2021-12-16 08:51:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:15,686 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:15,688 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:51:15,690 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:51:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:15,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:51:15,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:15,788 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:51:15,795 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:51:15,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:15,796 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433303772] [2021-12-16 08:51:15,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433303772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:15,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:15,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:51:15,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636730690] [2021-12-16 08:51:15,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:15,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:51:15,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:51:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:51:15,805 INFO L87 Difference]: Start difference. First operand 1230 states and 1297 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:51:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:18,255 INFO L93 Difference]: Finished difference Result 1819 states and 1926 transitions. [2021-12-16 08:51:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:51:18,256 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:51:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:18,260 INFO L225 Difference]: With dead ends: 1819 [2021-12-16 08:51:18,260 INFO L226 Difference]: Without dead ends: 1819 [2021-12-16 08:51:18,260 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:51:18,261 INFO L933 BasicCegarLoop]: 1012 mSDtfsCounter, 629 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:18,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 1690 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-16 08:51:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2021-12-16 08:51:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1431. [2021-12-16 08:51:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 812 states have (on average 2.0985221674876846) internal successors, (1704), 1426 states have internal predecessors, (1704), 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:51:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1710 transitions. [2021-12-16 08:51:18,313 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1710 transitions. Word has length 3 [2021-12-16 08:51:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:18,313 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 1710 transitions. [2021-12-16 08:51:18,313 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:51:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1710 transitions. [2021-12-16 08:51:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 08:51:18,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:18,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:18,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-16 08:51:18,514 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:51:18,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2021-12-16 08:51:18,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:18,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723755134] [2021-12-16 08:51:18,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:18,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:18,518 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:51:18,521 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:51:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:18,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:51:18,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:18,650 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:51:18,655 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:51:18,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:51:18,706 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:51:18,715 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:51:18,715 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:51:18,735 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:51:18,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:18,736 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723755134] [2021-12-16 08:51:18,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723755134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:18,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:18,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:51:18,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223758064] [2021-12-16 08:51:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:18,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:18,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:18,737 INFO L87 Difference]: Start difference. First operand 1431 states and 1710 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:51:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:21,166 INFO L93 Difference]: Finished difference Result 1609 states and 1899 transitions. [2021-12-16 08:51:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:21,167 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:51:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:21,172 INFO L225 Difference]: With dead ends: 1609 [2021-12-16 08:51:21,173 INFO L226 Difference]: Without dead ends: 1609 [2021-12-16 08:51:21,173 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:51:21,174 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 1450 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:21,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1453 Valid, 507 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-16 08:51:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2021-12-16 08:51:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1219. [2021-12-16 08:51:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 610 states have (on average 2.09672131147541) internal successors, (1279), 1214 states have internal predecessors, (1279), 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:51:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1285 transitions. [2021-12-16 08:51:21,223 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1285 transitions. Word has length 7 [2021-12-16 08:51:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:21,223 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1285 transitions. [2021-12-16 08:51:21,223 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:51:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1285 transitions. [2021-12-16 08:51:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:51:21,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:21,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:21,234 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:51:21,433 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:51:21,434 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2021-12-16 08:51:21,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:21,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381968967] [2021-12-16 08:51:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:21,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:21,436 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:51:21,438 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:51:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:21,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:51:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:21,551 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:51:21,560 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:51:21,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:21,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:21,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381968967] [2021-12-16 08:51:21,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381968967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:21,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:21,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:51:21,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806283535] [2021-12-16 08:51:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:21,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:51:21,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:51:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:51:21,562 INFO L87 Difference]: Start difference. First operand 1219 states and 1285 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:51:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:23,096 INFO L93 Difference]: Finished difference Result 1548 states and 1643 transitions. [2021-12-16 08:51:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:51:23,098 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:51:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:23,104 INFO L225 Difference]: With dead ends: 1548 [2021-12-16 08:51:23,104 INFO L226 Difference]: Without dead ends: 1548 [2021-12-16 08:51:23,104 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:51:23,105 INFO L933 BasicCegarLoop]: 1133 mSDtfsCounter, 973 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:23,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [976 Valid, 1476 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 08:51:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2021-12-16 08:51:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1172. [2021-12-16 08:51:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 610 states have (on average 2.019672131147541) internal successors, (1232), 1167 states have internal predecessors, (1232), 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:51:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1238 transitions. [2021-12-16 08:51:23,131 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1238 transitions. Word has length 8 [2021-12-16 08:51:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:23,131 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 1238 transitions. [2021-12-16 08:51:23,131 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:51:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1238 transitions. [2021-12-16 08:51:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:51:23,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:23,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:23,139 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:51:23,338 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:51:23,338 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2021-12-16 08:51:23,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:23,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666826221] [2021-12-16 08:51:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:23,340 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:23,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:23,341 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:51:23,342 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:51:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:23,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:51:23,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:23,446 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:51:23,465 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:51:23,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:23,466 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:23,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666826221] [2021-12-16 08:51:23,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666826221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:23,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:23,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:51:23,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332578382] [2021-12-16 08:51:23,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:23,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:51:23,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:23,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:51:23,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:51:23,468 INFO L87 Difference]: Start difference. First operand 1172 states and 1238 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:51:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:25,459 INFO L93 Difference]: Finished difference Result 1627 states and 1725 transitions. [2021-12-16 08:51:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:51:25,460 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:51:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:25,463 INFO L225 Difference]: With dead ends: 1627 [2021-12-16 08:51:25,463 INFO L226 Difference]: Without dead ends: 1627 [2021-12-16 08:51:25,464 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:51:25,464 INFO L933 BasicCegarLoop]: 1339 mSDtfsCounter, 674 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:25,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 1855 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-16 08:51:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-12-16 08:51:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1194. [2021-12-16 08:51:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 642 states have (on average 2.0062305295950154) internal successors, (1288), 1189 states have internal predecessors, (1288), 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:51:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1294 transitions. [2021-12-16 08:51:25,479 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1294 transitions. Word has length 8 [2021-12-16 08:51:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:25,479 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 1294 transitions. [2021-12-16 08:51:25,480 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:51:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1294 transitions. [2021-12-16 08:51:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 08:51:25,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:25,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:25,498 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:51:25,686 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:51:25,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 871378613, now seen corresponding path program 1 times [2021-12-16 08:51:25,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:25,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966063612] [2021-12-16 08:51:25,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:25,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:25,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:25,689 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:51:25,690 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:51:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:25,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 08:51:25,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:25,856 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:51:25,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:25,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:25,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966063612] [2021-12-16 08:51:25,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966063612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:25,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:25,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:25,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494346449] [2021-12-16 08:51:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:25,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:25,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:25,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:25,859 INFO L87 Difference]: Start difference. First operand 1194 states and 1294 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:51:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:26,465 INFO L93 Difference]: Finished difference Result 1841 states and 1984 transitions. [2021-12-16 08:51:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:51:26,466 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:51:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:26,470 INFO L225 Difference]: With dead ends: 1841 [2021-12-16 08:51:26,470 INFO L226 Difference]: Without dead ends: 1841 [2021-12-16 08:51:26,471 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:51:26,471 INFO L933 BasicCegarLoop]: 1358 mSDtfsCounter, 754 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:26,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 3645 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 08:51:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2021-12-16 08:51:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1439. [2021-12-16 08:51:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 887 states have (on average 1.9706877113866967) internal successors, (1748), 1434 states have internal predecessors, (1748), 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:51:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1754 transitions. [2021-12-16 08:51:26,513 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1754 transitions. Word has length 11 [2021-12-16 08:51:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:26,513 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 1754 transitions. [2021-12-16 08:51:26,514 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:51:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1754 transitions. [2021-12-16 08:51:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 08:51:26,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:26,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:26,523 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:51:26,721 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:51:26,722 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2021-12-16 08:51:26,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:26,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102227238] [2021-12-16 08:51:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:26,724 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:26,725 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:51:26,727 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:51:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:26,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 08:51:26,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:26,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:51:26,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:26,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102227238] [2021-12-16 08:51:26,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102227238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:26,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:26,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:51:26,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867146191] [2021-12-16 08:51:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:26,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:51:26,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:51:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:51:26,863 INFO L87 Difference]: Start difference. First operand 1439 states and 1754 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:51:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:26,882 INFO L93 Difference]: Finished difference Result 1601 states and 1902 transitions. [2021-12-16 08:51:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:51:26,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-16 08:51:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:26,886 INFO L225 Difference]: With dead ends: 1601 [2021-12-16 08:51:26,887 INFO L226 Difference]: Without dead ends: 1601 [2021-12-16 08:51:26,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:51:26,888 INFO L933 BasicCegarLoop]: 1182 mSDtfsCounter, 583 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1998 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:51:26,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 1998 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:51:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2021-12-16 08:51:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1379. [2021-12-16 08:51:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 851 states have (on average 1.9529964747356052) internal successors, (1662), 1374 states have internal predecessors, (1662), 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:51:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1668 transitions. [2021-12-16 08:51:26,906 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1668 transitions. Word has length 13 [2021-12-16 08:51:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:26,906 INFO L470 AbstractCegarLoop]: Abstraction has 1379 states and 1668 transitions. [2021-12-16 08:51:26,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:51:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1668 transitions. [2021-12-16 08:51:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 08:51:26,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:26,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:26,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-16 08:51:27,115 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:51:27,115 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -459414345, now seen corresponding path program 1 times [2021-12-16 08:51:27,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:27,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125042738] [2021-12-16 08:51:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:27,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:27,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:27,117 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:51:27,119 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:51:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:27,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:51:27,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:27,267 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:51:27,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:27,268 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:27,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125042738] [2021-12-16 08:51:27,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125042738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:27,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:27,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:27,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325187021] [2021-12-16 08:51:27,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:27,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:27,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:27,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:27,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:27,270 INFO L87 Difference]: Start difference. First operand 1379 states and 1668 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:51:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:27,344 INFO L93 Difference]: Finished difference Result 1573 states and 1846 transitions. [2021-12-16 08:51:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2021-12-16 08:51:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:27,348 INFO L225 Difference]: With dead ends: 1573 [2021-12-16 08:51:27,348 INFO L226 Difference]: Without dead ends: 1573 [2021-12-16 08:51:27,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:51:27,349 INFO L933 BasicCegarLoop]: 1137 mSDtfsCounter, 554 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 3083 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:27,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 3083 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 08:51:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2021-12-16 08:51:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1349. [2021-12-16 08:51:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 835 states have (on average 1.9209580838323352) internal successors, (1604), 1344 states have internal predecessors, (1604), 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:51:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1610 transitions. [2021-12-16 08:51:27,367 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1610 transitions. Word has length 15 [2021-12-16 08:51:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:27,367 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 1610 transitions. [2021-12-16 08:51:27,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:51:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1610 transitions. [2021-12-16 08:51:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-16 08:51:27,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:27,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:51:27,377 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:51:27,575 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:51:27,576 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr634ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2058395604, now seen corresponding path program 1 times [2021-12-16 08:51:27,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077085542] [2021-12-16 08:51:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:27,578 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:27,578 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:51:27,580 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:51:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:27,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:51:27,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:27,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:51:27,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:51:27,780 INFO L354 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2021-12-16 08:51:27,780 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:51:27,813 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-16 08:51:27,814 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:51:27,845 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:51:27,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:27,845 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:27,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077085542] [2021-12-16 08:51:27,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077085542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:27,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:27,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:27,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095782131] [2021-12-16 08:51:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:27,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:27,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:27,846 INFO L87 Difference]: Start difference. First operand 1349 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:51:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:28,725 INFO L93 Difference]: Finished difference Result 1785 states and 2105 transitions. [2021-12-16 08:51:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2021-12-16 08:51:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:28,730 INFO L225 Difference]: With dead ends: 1785 [2021-12-16 08:51:28,730 INFO L226 Difference]: Without dead ends: 1785 [2021-12-16 08:51:28,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:51:28,730 INFO L933 BasicCegarLoop]: 1108 mSDtfsCounter, 422 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:28,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 3244 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 39 Unchecked, 0.8s Time] [2021-12-16 08:51:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2021-12-16 08:51:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1348. [2021-12-16 08:51:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 834 states have (on average 1.920863309352518) internal successors, (1602), 1343 states have internal predecessors, (1602), 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:51:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1608 transitions. [2021-12-16 08:51:28,746 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1608 transitions. Word has length 16 [2021-12-16 08:51:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:28,746 INFO L470 AbstractCegarLoop]: Abstraction has 1348 states and 1608 transitions. [2021-12-16 08:51:28,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:51:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1608 transitions. [2021-12-16 08:51:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 08:51:28,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:28,747 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:51:28,760 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:51:28,954 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:51:28,954 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2021-12-16 08:51:28,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:28,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363103808] [2021-12-16 08:51:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:28,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:28,957 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:51:28,959 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:51:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:29,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 08:51:29,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:29,118 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:51:29,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:29,119 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363103808] [2021-12-16 08:51:29,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363103808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:29,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:29,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:51:29,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183650427] [2021-12-16 08:51:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:29,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:51:29,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:29,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:51:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:51:29,120 INFO L87 Difference]: Start difference. First operand 1348 states and 1608 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:51:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:29,140 INFO L93 Difference]: Finished difference Result 1288 states and 1522 transitions. [2021-12-16 08:51:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:51:29,141 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:51:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:29,144 INFO L225 Difference]: With dead ends: 1288 [2021-12-16 08:51:29,144 INFO L226 Difference]: Without dead ends: 1288 [2021-12-16 08:51:29,144 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:51:29,145 INFO L933 BasicCegarLoop]: 1103 mSDtfsCounter, 1087 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1125 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:51:29,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1090 Valid, 1125 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:51:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2021-12-16 08:51:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2021-12-16 08:51:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 798 states have (on average 1.899749373433584) internal successors, (1516), 1283 states have internal predecessors, (1516), 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:51:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1522 transitions. [2021-12-16 08:51:29,157 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1522 transitions. Word has length 18 [2021-12-16 08:51:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:29,158 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 1522 transitions. [2021-12-16 08:51:29,158 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:51:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1522 transitions. [2021-12-16 08:51:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 08:51:29,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:29,158 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:51:29,186 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:51:29,386 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:51:29,386 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2021-12-16 08:51:29,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731460653] [2021-12-16 08:51:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:29,387 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:29,404 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:51:29,412 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:51:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:29,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:51:29,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:29,577 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:51:29,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:29,578 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:29,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731460653] [2021-12-16 08:51:29,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731460653] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:29,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:29,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:29,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341102347] [2021-12-16 08:51:29,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:29,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:29,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:29,579 INFO L87 Difference]: Start difference. First operand 1288 states and 1522 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:51:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:29,644 INFO L93 Difference]: Finished difference Result 1260 states and 1466 transitions. [2021-12-16 08:51:29,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:29,644 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:51:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:29,647 INFO L225 Difference]: With dead ends: 1260 [2021-12-16 08:51:29,648 INFO L226 Difference]: Without dead ends: 1260 [2021-12-16 08:51:29,648 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:51:29,648 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1058 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 2131 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:51:29,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 2131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:51:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2021-12-16 08:51:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1258. [2021-12-16 08:51:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 782 states have (on average 1.8644501278772379) internal successors, (1458), 1253 states have internal predecessors, (1458), 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:51:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1464 transitions. [2021-12-16 08:51:29,688 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1464 transitions. Word has length 20 [2021-12-16 08:51:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:29,689 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1464 transitions. [2021-12-16 08:51:29,689 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:51:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1464 transitions. [2021-12-16 08:51:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:51:29,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:29,689 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:51:29,700 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:51:29,890 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:51:29,890 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2021-12-16 08:51:29,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251967934] [2021-12-16 08:51:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:29,891 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:29,892 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:51:29,893 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:51:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:30,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:51:30,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:30,074 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:51:30,137 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:51:30,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:30,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:30,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251967934] [2021-12-16 08:51:30,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251967934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:30,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:30,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:51:30,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043034337] [2021-12-16 08:51:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:30,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:30,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:30,138 INFO L87 Difference]: Start difference. First operand 1258 states and 1464 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:51:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:32,056 INFO L93 Difference]: Finished difference Result 1838 states and 2167 transitions. [2021-12-16 08:51:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:51:32,058 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:51:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:32,061 INFO L225 Difference]: With dead ends: 1838 [2021-12-16 08:51:32,062 INFO L226 Difference]: Without dead ends: 1838 [2021-12-16 08:51:32,062 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:51:32,062 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 1714 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:32,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 1217 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-16 08:51:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-12-16 08:51:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1254. [2021-12-16 08:51:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 782 states have (on average 1.854219948849105) internal successors, (1450), 1249 states have internal predecessors, (1450), 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:51:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1456 transitions. [2021-12-16 08:51:32,074 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1456 transitions. Word has length 34 [2021-12-16 08:51:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:32,075 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 1456 transitions. [2021-12-16 08:51:32,075 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:51:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1456 transitions. [2021-12-16 08:51:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:51:32,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:32,076 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:51:32,088 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:51:32,283 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:51:32,283 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2021-12-16 08:51:32,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:32,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941712840] [2021-12-16 08:51:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:32,284 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:32,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:32,285 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:51:32,287 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:51:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:32,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 08:51:32,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:32,440 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:51:32,592 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:51:32,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:32,592 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:32,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941712840] [2021-12-16 08:51:32,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941712840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:32,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:32,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:51:32,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418476932] [2021-12-16 08:51:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:32,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:32,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:32,593 INFO L87 Difference]: Start difference. First operand 1254 states and 1456 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:51:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:35,389 INFO L93 Difference]: Finished difference Result 1968 states and 2276 transitions. [2021-12-16 08:51:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:51:35,390 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:51:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:35,394 INFO L225 Difference]: With dead ends: 1968 [2021-12-16 08:51:35,394 INFO L226 Difference]: Without dead ends: 1968 [2021-12-16 08:51:35,394 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:51:35,395 INFO L933 BasicCegarLoop]: 1381 mSDtfsCounter, 1212 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:35,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1212 Valid, 2459 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-16 08:51:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2021-12-16 08:51:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1250. [2021-12-16 08:51:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 782 states have (on average 1.843989769820972) internal successors, (1442), 1245 states have internal predecessors, (1442), 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:51:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1448 transitions. [2021-12-16 08:51:35,411 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1448 transitions. Word has length 34 [2021-12-16 08:51:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:35,411 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1448 transitions. [2021-12-16 08:51:35,411 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:51:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1448 transitions. [2021-12-16 08:51:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-16 08:51:35,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:35,412 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:51:35,420 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:51:35,620 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:51:35,620 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2021-12-16 08:51:35,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:35,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074661137] [2021-12-16 08:51:35,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:35,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:35,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:35,622 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:51:35,623 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:51:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:35,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:51:35,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:35,940 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:51:35,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:35,940 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:35,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074661137] [2021-12-16 08:51:35,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074661137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:35,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:35,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:35,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54428917] [2021-12-16 08:51:35,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:35,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:35,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:35,942 INFO L87 Difference]: Start difference. First operand 1250 states and 1448 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:51:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:35,990 INFO L93 Difference]: Finished difference Result 1238 states and 1428 transitions. [2021-12-16 08:51:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:35,990 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:51:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:35,994 INFO L225 Difference]: With dead ends: 1238 [2021-12-16 08:51:35,994 INFO L226 Difference]: Without dead ends: 1238 [2021-12-16 08:51:35,995 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:51:35,995 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 1034 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 2109 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:51:35,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 2109 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:51:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2021-12-16 08:51:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2021-12-16 08:51:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 770 states have (on average 1.8467532467532468) internal successors, (1422), 1233 states have internal predecessors, (1422), 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:51:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1428 transitions. [2021-12-16 08:51:36,009 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1428 transitions. Word has length 52 [2021-12-16 08:51:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:36,009 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 1428 transitions. [2021-12-16 08:51:36,009 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:51:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1428 transitions. [2021-12-16 08:51:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 08:51:36,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:36,012 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:51:36,022 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:51:36,221 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:51:36,222 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2021-12-16 08:51:36,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:36,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268411764] [2021-12-16 08:51:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:36,223 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:36,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:36,236 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:51:36,252 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:51:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:36,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:51:36,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:36,564 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:51:36,569 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:51:37,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:51:37,037 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:51:37,054 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:51:37,054 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:51:37,066 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:51:37,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:37,067 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:37,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268411764] [2021-12-16 08:51:37,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268411764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:37,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:37,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:51:37,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946981879] [2021-12-16 08:51:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:37,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:37,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:37,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:37,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:37,070 INFO L87 Difference]: Start difference. First operand 1238 states and 1428 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:51:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:39,121 INFO L93 Difference]: Finished difference Result 1586 states and 1893 transitions. [2021-12-16 08:51:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:39,123 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:51:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:39,131 INFO L225 Difference]: With dead ends: 1586 [2021-12-16 08:51:39,131 INFO L226 Difference]: Without dead ends: 1586 [2021-12-16 08:51:39,133 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:51:39,133 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 1107 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:39,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1110 Valid, 789 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-16 08:51:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2021-12-16 08:51:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1168. [2021-12-16 08:51:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 738 states have (on average 1.7859078590785908) internal successors, (1318), 1163 states have internal predecessors, (1318), 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:51:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1324 transitions. [2021-12-16 08:51:39,161 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1324 transitions. Word has length 60 [2021-12-16 08:51:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:39,161 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 1324 transitions. [2021-12-16 08:51:39,161 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:51:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1324 transitions. [2021-12-16 08:51:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:51:39,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:39,162 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:51:39,192 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:51:39,362 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:51:39,362 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2021-12-16 08:51:39,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:39,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830882379] [2021-12-16 08:51:39,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:39,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:39,364 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:51:39,366 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:51:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:39,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:51:39,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:39,661 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:51:39,675 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:51:39,711 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:51:39,745 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:51:39,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:39,746 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:39,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830882379] [2021-12-16 08:51:39,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830882379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:39,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:39,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:39,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765214208] [2021-12-16 08:51:39,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:39,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:51:39,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:51:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:51:39,747 INFO L87 Difference]: Start difference. First operand 1168 states and 1324 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:51:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:41,806 INFO L93 Difference]: Finished difference Result 1167 states and 1323 transitions. [2021-12-16 08:51:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:51:41,807 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:51:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:41,810 INFO L225 Difference]: With dead ends: 1167 [2021-12-16 08:51:41,810 INFO L226 Difference]: Without dead ends: 1167 [2021-12-16 08:51:41,810 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:51:41,810 INFO L933 BasicCegarLoop]: 1012 mSDtfsCounter, 4 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:41,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2564 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-16 08:51:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2021-12-16 08:51:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2021-12-16 08:51:41,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 738 states have (on average 1.7845528455284554) internal successors, (1317), 1162 states have internal predecessors, (1317), 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:51:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1323 transitions. [2021-12-16 08:51:41,821 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1323 transitions. Word has length 65 [2021-12-16 08:51:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:41,821 INFO L470 AbstractCegarLoop]: Abstraction has 1167 states and 1323 transitions. [2021-12-16 08:51:41,821 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:51:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1323 transitions. [2021-12-16 08:51:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:51:41,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:41,822 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:51:41,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-16 08:51:42,030 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:51:42,031 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2021-12-16 08:51:42,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:42,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861304168] [2021-12-16 08:51:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:42,032 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:42,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:42,033 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:51:42,034 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:51:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:42,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 08:51:42,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:42,354 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:51:42,369 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:51:42,375 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:51:42,413 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:51:42,416 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:51:42,428 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:51:42,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:42,429 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861304168] [2021-12-16 08:51:42,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861304168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:42,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:42,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:42,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402702574] [2021-12-16 08:51:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:42,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:51:42,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:51:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:51:42,430 INFO L87 Difference]: Start difference. First operand 1167 states and 1323 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:51:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:44,965 INFO L93 Difference]: Finished difference Result 1166 states and 1322 transitions. [2021-12-16 08:51:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:51:44,966 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:51:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:44,968 INFO L225 Difference]: With dead ends: 1166 [2021-12-16 08:51:44,968 INFO L226 Difference]: Without dead ends: 1166 [2021-12-16 08:51:44,968 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:51:44,969 INFO L933 BasicCegarLoop]: 1012 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:44,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2621 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-16 08:51:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2021-12-16 08:51:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2021-12-16 08:51:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 737 states have (on average 1.78561736770692) internal successors, (1316), 1161 states have internal predecessors, (1316), 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:51:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1322 transitions. [2021-12-16 08:51:44,995 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1322 transitions. Word has length 65 [2021-12-16 08:51:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:44,996 INFO L470 AbstractCegarLoop]: Abstraction has 1166 states and 1322 transitions. [2021-12-16 08:51:44,996 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:51:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1322 transitions. [2021-12-16 08:51:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-16 08:51:44,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:44,997 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:51:45,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-16 08:51:45,206 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:51:45,206 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1088613615, now seen corresponding path program 1 times [2021-12-16 08:51:45,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791897884] [2021-12-16 08:51:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:45,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:45,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:45,209 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:51:45,210 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:51:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:45,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:51:45,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:45,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:51:45,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:51:45,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791897884] [2021-12-16 08:51:45,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791897884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:51:45,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:51:45,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:51:45,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716459246] [2021-12-16 08:51:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:51:45,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:51:45,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:51:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:51:45,552 INFO L87 Difference]: Start difference. First operand 1166 states and 1322 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:51:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:45,586 INFO L93 Difference]: Finished difference Result 1169 states and 1326 transitions. [2021-12-16 08:51:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:51:45,587 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:51:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:45,594 INFO L225 Difference]: With dead ends: 1169 [2021-12-16 08:51:45,594 INFO L226 Difference]: Without dead ends: 1169 [2021-12-16 08:51:45,594 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:51:45,595 INFO L933 BasicCegarLoop]: 1012 mSDtfsCounter, 2 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3031 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:51:45,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 3031 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:51:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-12-16 08:51:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2021-12-16 08:51:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 739 states have (on average 1.7848443843031123) internal successors, (1319), 1164 states have internal predecessors, (1319), 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:51:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1326 transitions. [2021-12-16 08:51:45,614 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1326 transitions. Word has length 73 [2021-12-16 08:51:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:45,614 INFO L470 AbstractCegarLoop]: Abstraction has 1169 states and 1326 transitions. [2021-12-16 08:51:45,614 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:51:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1326 transitions. [2021-12-16 08:51:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-16 08:51:45,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:45,615 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:51:45,644 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:51:45,825 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:51:45,825 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 145492468, now seen corresponding path program 1 times [2021-12-16 08:51:45,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:45,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031418585] [2021-12-16 08:51:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:51:45,826 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:45,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:45,827 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:51:45,867 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:51:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:51:46,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:51:46,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:46,182 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:51:46,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:51:46,300 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:51:46,301 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:46,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031418585] [2021-12-16 08:51:46,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031418585] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:51:46,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:51:46,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-16 08:51:46,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958014291] [2021-12-16 08:51:46,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:51:46,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 08:51:46,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 08:51:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 08:51:46,302 INFO L87 Difference]: Start difference. First operand 1169 states and 1326 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:51:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:46,444 INFO L93 Difference]: Finished difference Result 1181 states and 1343 transitions. [2021-12-16 08:51:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 08:51:46,445 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:51:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:46,447 INFO L225 Difference]: With dead ends: 1181 [2021-12-16 08:51:46,447 INFO L226 Difference]: Without dead ends: 1181 [2021-12-16 08:51:46,447 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:51:46,448 INFO L933 BasicCegarLoop]: 1013 mSDtfsCounter, 14 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6054 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:46,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 6054 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 08:51:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-12-16 08:51:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1179. [2021-12-16 08:51:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 748 states have (on average 1.7834224598930482) internal successors, (1334), 1173 states have internal predecessors, (1334), 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:51:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1341 transitions. [2021-12-16 08:51:46,464 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1341 transitions. Word has length 74 [2021-12-16 08:51:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:46,465 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 1341 transitions. [2021-12-16 08:51:46,465 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:51:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1341 transitions. [2021-12-16 08:51:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-16 08:51:46,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:46,466 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:51:46,488 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:51:46,675 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:51:46,675 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2026145327, now seen corresponding path program 2 times [2021-12-16 08:51:46,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:46,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118153916] [2021-12-16 08:51:46,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 08:51:46,677 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:46,677 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:51:46,695 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:51:47,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 08:51:47,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:51:47,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:51:47,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:47,237 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:51:47,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:51:47,526 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:51:47,526 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:47,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118153916] [2021-12-16 08:51:47,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118153916] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:51:47,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:51:47,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-16 08:51:47,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581565705] [2021-12-16 08:51:47,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:51:47,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 08:51:47,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 08:51:47,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-16 08:51:47,528 INFO L87 Difference]: Start difference. First operand 1179 states and 1341 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:51:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:48,042 INFO L93 Difference]: Finished difference Result 1200 states and 1369 transitions. [2021-12-16 08:51:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 08:51:48,043 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:51:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:48,052 INFO L225 Difference]: With dead ends: 1200 [2021-12-16 08:51:48,053 INFO L226 Difference]: Without dead ends: 1196 [2021-12-16 08:51:48,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-16 08:51:48,054 INFO L933 BasicCegarLoop]: 1016 mSDtfsCounter, 57 mSDsluCounter, 7076 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 8092 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:48,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 8092 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 08:51:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-12-16 08:51:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1188. [2021-12-16 08:51:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 757 states have (on average 1.7780713342140027) internal successors, (1346), 1182 states have internal predecessors, (1346), 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:51:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1353 transitions. [2021-12-16 08:51:48,089 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1353 transitions. Word has length 77 [2021-12-16 08:51:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:48,089 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 1353 transitions. [2021-12-16 08:51:48,090 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:51:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1353 transitions. [2021-12-16 08:51:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 08:51:48,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:48,090 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:51:48,127 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:51:48,302 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:51:48,303 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:48,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash -570392561, now seen corresponding path program 3 times [2021-12-16 08:51:48,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:48,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969755998] [2021-12-16 08:51:48,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 08:51:48,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:48,305 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:51:48,342 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:51:49,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-16 08:51:49,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:51:49,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 08:51:49,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:49,278 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:51:49,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:51:49,889 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:51:49,889 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:49,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969755998] [2021-12-16 08:51:49,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969755998] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:51:49,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:51:49,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-16 08:51:49,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154202998] [2021-12-16 08:51:49,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:51:49,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 08:51:49,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:49,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 08:51:49,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-16 08:51:49,890 INFO L87 Difference]: Start difference. First operand 1188 states and 1353 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:51:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:51:52,616 INFO L93 Difference]: Finished difference Result 1230 states and 1415 transitions. [2021-12-16 08:51:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-16 08:51:52,617 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:51:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:51:52,619 INFO L225 Difference]: With dead ends: 1230 [2021-12-16 08:51:52,619 INFO L226 Difference]: Without dead ends: 1224 [2021-12-16 08:51:52,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-16 08:51:52,620 INFO L933 BasicCegarLoop]: 1021 mSDtfsCounter, 132 mSDsluCounter, 12194 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 13215 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 08:51:52,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 13215 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-16 08:51:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2021-12-16 08:51:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1206. [2021-12-16 08:51:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 775 states have (on average 1.7664516129032257) internal successors, (1369), 1200 states have internal predecessors, (1369), 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:51:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1376 transitions. [2021-12-16 08:51:52,632 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1376 transitions. Word has length 83 [2021-12-16 08:51:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:51:52,633 INFO L470 AbstractCegarLoop]: Abstraction has 1206 states and 1376 transitions. [2021-12-16 08:51:52,633 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:51:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1376 transitions. [2021-12-16 08:51:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-16 08:51:52,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:51:52,634 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:51:52,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-16 08:51:52,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:51:52,845 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:51:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:51:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash -322585649, now seen corresponding path program 4 times [2021-12-16 08:51:52,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:51:52,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110753237] [2021-12-16 08:51:52,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 08:51:52,846 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:51:52,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:51:52,847 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 08:51:52,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-16 08:51:53,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 08:51:53,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:51:53,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 08:51:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:51:53,532 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:51:53,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:51:54,970 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:51:54,970 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:51:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110753237] [2021-12-16 08:51:54,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110753237] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:51:54,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:51:54,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-16 08:51:54,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888464945] [2021-12-16 08:51:54,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:51:54,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-16 08:51:54,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:51:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-16 08:51:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-16 08:51:54,972 INFO L87 Difference]: Start difference. First operand 1206 states and 1376 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:52:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:05,928 INFO L93 Difference]: Finished difference Result 1286 states and 1488 transitions. [2021-12-16 08:52:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-16 08:52:05,928 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:52:05,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:05,931 INFO L225 Difference]: With dead ends: 1286 [2021-12-16 08:52:05,931 INFO L226 Difference]: Without dead ends: 1282 [2021-12-16 08:52:05,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-16 08:52:05,951 INFO L933 BasicCegarLoop]: 1033 mSDtfsCounter, 410 mSDsluCounter, 24679 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 25712 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:05,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 25712 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-16 08:52:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-12-16 08:52:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1240. [2021-12-16 08:52:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 809 states have (on average 1.7490729295426453) internal successors, (1415), 1234 states have internal predecessors, (1415), 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:52:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1422 transitions. [2021-12-16 08:52:05,979 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1422 transitions. Word has length 95 [2021-12-16 08:52:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:05,980 INFO L470 AbstractCegarLoop]: Abstraction has 1240 states and 1422 transitions. [2021-12-16 08:52:05,980 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:52:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1422 transitions. [2021-12-16 08:52:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-16 08:52:05,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:05,981 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:52:05,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:06,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:06,193 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 631 more)] === [2021-12-16 08:52:06,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2011177647, now seen corresponding path program 5 times [2021-12-16 08:52:06,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:06,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108434547] [2021-12-16 08:52:06,194 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:52:06,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:06,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:06,195 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 08:52:06,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-16 08:52:07,381 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-16 08:52:07,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:52:07,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-16 08:52:07,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:07,432 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:52:07,558 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:52:07,558 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:52:07,565 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:52:07,596 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:52:07,605 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:52:07,696 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 22 treesize of output 10 [2021-12-16 08:52:07,700 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 9 treesize of output 3 [2021-12-16 08:52:07,743 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943)))) is different from true [2021-12-16 08:52:07,754 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:52:07,765 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:52:07,776 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:52:07,787 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:52:07,798 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952)))) is different from true [2021-12-16 08:52:07,808 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954)))) is different from true [2021-12-16 08:52:07,819 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:52:07,830 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:52:07,840 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:52:07,851 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:52:07,861 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (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$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964)))) is different from true [2021-12-16 08:52:07,882 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_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2021-12-16 08:52:07,892 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_1968 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1968))) (exists ((v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1969)))) is different from true [2021-12-16 08:52:07,935 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973)))) is different from true [2021-12-16 08:52:07,946 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:07,958 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1976 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1976))) (exists ((v_ArrVal_1977 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1977))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:07,968 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1979 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1979))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1978 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1978)))) is different from true [2021-12-16 08:52:07,979 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_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980)))) is different from true [2021-12-16 08:52:07,991 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1982 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1982))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1983 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1983)))) is different from true [2021-12-16 08:52:08,002 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985)))) is different from true [2021-12-16 08:52:08,037 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989)))) is different from true [2021-12-16 08:52:08,071 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_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992))) (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993)))) is different from true [2021-12-16 08:52:08,081 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_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994))) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995)))) is different from true [2021-12-16 08:52:08,091 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996)))) is different from true [2021-12-16 08:52:08,102 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1998 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1998))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1999 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1999)))) is different from true [2021-12-16 08:52:08,112 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2001))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2000)))) is different from true [2021-12-16 08:52:08,144 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2004))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_2005 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2005)))) is different from true [2021-12-16 08:52:08,176 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2008))) (exists ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2009))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:08,186 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_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2011))) (exists ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2010)))) is different from true [2021-12-16 08:52:08,197 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_2013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2013))) (exists ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2012)))) is different from true [2021-12-16 08:52:08,231 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2016))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_2017 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2017)))) is different from true [2021-12-16 08:52:08,242 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2018 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2018))) (exists ((v_ArrVal_2019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2019))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:08,346 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2029 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2029))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_2028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2028)))) is different from true [2021-12-16 08:52:08,382 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 08:52:08,383 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:52:08,387 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:52:08,423 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 31 treesize of output 13 [2021-12-16 08:52:08,426 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 19 treesize of output 7 [2021-12-16 08:52:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 935 not checked. [2021-12-16 08:52:08,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:52:09,025 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2121 (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_2121) |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_2120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2121) |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:52:09,029 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:09,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108434547] [2021-12-16 08:52:09,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108434547] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 08:52:09,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1683653893] [2021-12-16 08:52:09,029 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:52:09,030 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-16 08:52:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-16 08:52:09,031 INFO L229 MonitoredProcess]: Starting monitored process 25 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:52:09,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process