./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:39:34,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:39:34,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:39:34,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:39:34,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:39:34,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:39:34,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:39:34,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:39:34,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:39:34,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:39:34,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:39:34,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:39:34,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:39:34,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:39:34,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:39:34,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:39:34,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:39:34,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:39:34,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:39:34,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:39:34,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:39:34,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:39:34,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:39:34,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:39:34,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:39:34,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:39:34,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:39:34,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:39:34,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:39:34,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:39:34,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:39:34,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:39:34,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:39:34,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:39:34,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:39:34,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:39:34,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:39:34,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:39:34,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:39:34,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:39:34,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:39:34,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-12-21 20:39:34,215 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:39:34,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:39:34,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:39:34,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:39:34,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:39:34,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:39:34,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:39:34,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:39:34,218 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:39:34,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:39:34,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:39:34,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:39:34,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:39:34,219 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 20:39:34,219 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 20:39:34,219 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 20:39:34,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:39:34,220 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 20:39:34,220 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:39:34,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:39:34,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:39:34,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:39:34,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:39:34,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:39:34,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:39:34,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:39:34,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:39:34,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:39:34,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2021-12-21 20:39:34,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:39:34,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:39:34,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:39:34,462 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:39:34,462 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:39:34,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-21 20:39:34,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379d8b9e1/5d8b5f96b2be42bb8330c8579bcd796c/FLAGe56633489 [2021-12-21 20:39:34,937 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:39:34,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-21 20:39:34,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379d8b9e1/5d8b5f96b2be42bb8330c8579bcd796c/FLAGe56633489 [2021-12-21 20:39:34,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379d8b9e1/5d8b5f96b2be42bb8330c8579bcd796c [2021-12-21 20:39:34,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:39:34,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:39:34,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:39:34,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:39:34,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:39:34,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:39:34" (1/1) ... [2021-12-21 20:39:34,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aae4194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:34, skipping insertion in model container [2021-12-21 20:39:34,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:39:34" (1/1) ... [2021-12-21 20:39:34,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:39:35,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:39:35,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-21 20:39:35,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:39:35,471 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-21 20:39:35,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@161edec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:35, skipping insertion in model container [2021-12-21 20:39:35,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:39:35,472 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-21 20:39:35,473 INFO L158 Benchmark]: Toolchain (without parser) took 500.31ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 52.1MB in the beginning and 72.7MB in the end (delta: -20.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 20:39:35,474 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:39:35,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.40ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 51.9MB in the beginning and 72.7MB in the end (delta: -20.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 20:39:35,477 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.40ms. Allocated memory was 83.9MB in the beginning and 107.0MB in the end (delta: 23.1MB). Free memory was 51.9MB in the beginning and 72.7MB in the end (delta: -20.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: Unsupported Syntax Found a cast between two array/pointer types 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:39:36,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:39:36,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:39:36,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:39:36,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:39:36,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:39:36,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:39:36,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:39:36,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:39:36,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:39:37,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:39:37,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:39:37,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:39:37,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:39:37,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:39:37,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:39:37,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:39:37,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:39:37,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:39:37,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:39:37,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:39:37,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:39:37,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:39:37,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:39:37,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:39:37,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:39:37,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:39:37,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:39:37,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:39:37,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:39:37,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:39:37,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:39:37,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:39:37,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:39:37,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:39:37,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:39:37,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:39:37,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:39:37,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:39:37,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:39:37,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:39:37,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2021-12-21 20:39:37,060 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:39:37,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:39:37,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:39:37,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:39:37,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:39:37,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:39:37,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:39:37,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:39:37,063 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:39:37,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 20:39:37,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:39:37,065 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 20:39:37,065 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 20:39:37,065 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 20:39:37,065 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:39:37,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:39:37,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:39:37,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:39:37,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:39:37,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:39:37,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:39:37,066 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 20:39:37,066 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 20:39:37,066 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:39:37,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 20:39:37,067 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2021-12-21 20:39:37,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:39:37,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:39:37,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:39:37,339 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:39:37,340 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:39:37,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-21 20:39:37,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4350dccd7/24f264533ce6440a88741b0b0a0f755d/FLAG8a5581747 [2021-12-21 20:39:37,850 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:39:37,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-21 20:39:37,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4350dccd7/24f264533ce6440a88741b0b0a0f755d/FLAG8a5581747 [2021-12-21 20:39:38,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4350dccd7/24f264533ce6440a88741b0b0a0f755d [2021-12-21 20:39:38,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:39:38,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:39:38,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:39:38,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:39:38,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:39:38,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:38,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a67c0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38, skipping insertion in model container [2021-12-21 20:39:38,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:38,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:39:38,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:39:38,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-21 20:39:38,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:39:38,740 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-21 20:39:38,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:39:38,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-21 20:39:38,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:39:38,824 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:39:38,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-21 20:39:38,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:39:38,971 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:39:38,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38 WrapperNode [2021-12-21 20:39:38,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:39:38,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:39:38,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:39:38,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:39:38,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,058 INFO L137 Inliner]: procedures = 353, calls = 114, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 386 [2021-12-21 20:39:39,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:39:39,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:39:39,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:39:39,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:39:39,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:39:39,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:39:39,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:39:39,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:39:39,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (1/1) ... [2021-12-21 20:39:39,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:39:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:39:39,163 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-21 20:39:39,207 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-21 20:39:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-21 20:39:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 20:39:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-21 20:39:39,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-21 20:39:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 20:39:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-21 20:39:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:39:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 20:39:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:39:39,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:39:39,509 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:39:39,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:39:40,382 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:39:40,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:39:40,388 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-21 20:39:40,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:39:40 BoogieIcfgContainer [2021-12-21 20:39:40,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:39:40,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:39:40,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:39:40,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:39:40,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:39:38" (1/3) ... [2021-12-21 20:39:40,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68877904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:39:40, skipping insertion in model container [2021-12-21 20:39:40,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:39:38" (2/3) ... [2021-12-21 20:39:40,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68877904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:39:40, skipping insertion in model container [2021-12-21 20:39:40,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:39:40" (3/3) ... [2021-12-21 20:39:40,396 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-2.i [2021-12-21 20:39:40,400 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:39:40,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2021-12-21 20:39:40,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:39:40,446 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-21 20:39:40,446 INFO L340 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2021-12-21 20:39:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 20:39:40,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:40,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 20:39:40,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2021-12-21 20:39:40,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:40,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980059606] [2021-12-21 20:39:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:40,488 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:40,490 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-21 20:39:40,498 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-21 20:39:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:40,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:39:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:40,676 INFO L387 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-21 20:39:40,684 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-21 20:39:40,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:40,686 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:40,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980059606] [2021-12-21 20:39:40,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980059606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:40,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:40,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:39:40,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734880347] [2021-12-21 20:39:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:40,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:39:40,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:39:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:39:40,716 INFO L87 Difference]: Start difference. First operand has 245 states, 147 states have (on average 1.945578231292517) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:41,074 INFO L93 Difference]: Finished difference Result 253 states and 287 transitions. [2021-12-21 20:39:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:39:41,076 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-21 20:39:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:41,083 INFO L225 Difference]: With dead ends: 253 [2021-12-21 20:39:41,083 INFO L226 Difference]: Without dead ends: 251 [2021-12-21 20:39:41,084 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-21 20:39:41,086 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 241 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:41,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:39:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-21 20:39:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2021-12-21 20:39:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.8591549295774648) internal successors, (264), 231 states have internal predecessors, (264), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2021-12-21 20:39:41,119 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 3 [2021-12-21 20:39:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:41,120 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2021-12-21 20:39:41,120 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-21 20:39:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2021-12-21 20:39:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 20:39:41,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:41,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 20:39:41,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-21 20:39:41,329 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-21 20:39:41,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2021-12-21 20:39:41,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:41,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999383208] [2021-12-21 20:39:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:41,331 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:41,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:41,364 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-21 20:39:41,366 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-21 20:39:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:41,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:39:41,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:41,469 INFO L387 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-21 20:39:41,478 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-21 20:39:41,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:41,478 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:41,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999383208] [2021-12-21 20:39:41,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999383208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:41,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:41,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:39:41,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337786064] [2021-12-21 20:39:41,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:41,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:39:41,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:41,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:39:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:39:41,481 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:42,023 INFO L93 Difference]: Finished difference Result 234 states and 267 transitions. [2021-12-21 20:39:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:39:42,024 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-21 20:39:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:42,025 INFO L225 Difference]: With dead ends: 234 [2021-12-21 20:39:42,025 INFO L226 Difference]: Without dead ends: 234 [2021-12-21 20:39:42,025 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-21 20:39:42,026 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:42,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 430 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 20:39:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-21 20:39:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-21 20:39:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.852112676056338) internal successors, (263), 230 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2021-12-21 20:39:42,040 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 3 [2021-12-21 20:39:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:42,040 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2021-12-21 20:39:42,040 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-21 20:39:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2021-12-21 20:39:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 20:39:42,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:42,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 20:39:42,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 20:39:42,249 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-21 20:39:42,250 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2021-12-21 20:39:42,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:42,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834034501] [2021-12-21 20:39:42,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:42,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:42,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:42,252 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-21 20:39:42,254 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-21 20:39:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:42,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:39:42,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:42,370 INFO L387 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-21 20:39:42,422 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-21 20:39:42,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:42,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:42,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834034501] [2021-12-21 20:39:42,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834034501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:42,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:42,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:39:42,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182137157] [2021-12-21 20:39:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:42,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:39:42,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:39:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:39:42,425 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:42,974 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2021-12-21 20:39:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:39:42,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-21 20:39:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:42,976 INFO L225 Difference]: With dead ends: 238 [2021-12-21 20:39:42,976 INFO L226 Difference]: Without dead ends: 238 [2021-12-21 20:39:42,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:39:42,977 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 17 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:42,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 431 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 20:39:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-21 20:39:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2021-12-21 20:39:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 232 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2021-12-21 20:39:42,987 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 6 [2021-12-21 20:39:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:42,987 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2021-12-21 20:39:42,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2021-12-21 20:39:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 20:39:42,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:42,988 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:43,005 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-21 20:39:43,196 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-21 20:39:43,197 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2080656212, now seen corresponding path program 1 times [2021-12-21 20:39:43,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165958274] [2021-12-21 20:39:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:43,198 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:43,199 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-21 20:39:43,202 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-21 20:39:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:43,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:39:43,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:43,319 INFO L387 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-21 20:39:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:39:43,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:39:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:39:44,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:44,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165958274] [2021-12-21 20:39:44,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165958274] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:39:44,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:39:44,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-21 20:39:44,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516502733] [2021-12-21 20:39:44,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 20:39:44,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:39:44,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:44,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:39:44,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:39:44,404 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:47,856 INFO L93 Difference]: Finished difference Result 242 states and 275 transitions. [2021-12-21 20:39:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:39:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 20:39:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:47,859 INFO L225 Difference]: With dead ends: 242 [2021-12-21 20:39:47,859 INFO L226 Difference]: Without dead ends: 242 [2021-12-21 20:39:47,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:39:47,860 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 31 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:47,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 1116 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-12-21 20:39:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-21 20:39:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-21 20:39:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 151 states have (on average 1.794701986754967) internal successors, (271), 238 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 275 transitions. [2021-12-21 20:39:47,865 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 275 transitions. Word has length 10 [2021-12-21 20:39:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:47,866 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 275 transitions. [2021-12-21 20:39:47,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 275 transitions. [2021-12-21 20:39:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-21 20:39:47,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:47,866 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:47,880 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-21 20:39:48,074 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-21 20:39:48,074 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:48,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1026813049, now seen corresponding path program 1 times [2021-12-21 20:39:48,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:48,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822780947] [2021-12-21 20:39:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:48,076 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:48,078 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-21 20:39:48,079 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-21 20:39:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:48,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:39:48,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:39:48,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:39:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:39:48,346 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:48,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822780947] [2021-12-21 20:39:48,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822780947] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:39:48,346 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:39:48,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-21 20:39:48,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267179921] [2021-12-21 20:39:48,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 20:39:48,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 20:39:48,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 20:39:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:39:48,347 INFO L87 Difference]: Start difference. First operand 242 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:48,520 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2021-12-21 20:39:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:39:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-21 20:39:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:48,525 INFO L225 Difference]: With dead ends: 262 [2021-12-21 20:39:48,526 INFO L226 Difference]: Without dead ends: 262 [2021-12-21 20:39:48,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:39:48,528 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 24 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:48,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1835 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:39:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-21 20:39:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-12-21 20:39:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 171 states have (on average 1.7017543859649122) internal successors, (291), 258 states have internal predecessors, (291), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2021-12-21 20:39:48,549 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 19 [2021-12-21 20:39:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:48,549 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2021-12-21 20:39:48,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2021-12-21 20:39:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 20:39:48,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:48,550 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:48,565 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-21 20:39:48,753 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-21 20:39:48,753 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098840, now seen corresponding path program 2 times [2021-12-21 20:39:48,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:48,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629999883] [2021-12-21 20:39:48,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:39:48,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:48,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:48,755 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-21 20:39:48,764 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-21 20:39:48,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:39:48,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:39:48,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:39:48,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:48,924 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 20:39:48,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2021-12-21 20:39:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-21 20:39:49,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:49,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:49,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629999883] [2021-12-21 20:39:49,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629999883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:49,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:49,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-21 20:39:49,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117434246] [2021-12-21 20:39:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:49,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:39:49,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:39:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:39:49,135 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:49,437 INFO L93 Difference]: Finished difference Result 277 states and 311 transitions. [2021-12-21 20:39:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:39:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 20:39:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:49,438 INFO L225 Difference]: With dead ends: 277 [2021-12-21 20:39:49,438 INFO L226 Difference]: Without dead ends: 277 [2021-12-21 20:39:49,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:39:49,439 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 237 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:49,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:39:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-21 20:39:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2021-12-21 20:39:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 171 states have (on average 1.695906432748538) internal successors, (290), 257 states have internal predecessors, (290), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 294 transitions. [2021-12-21 20:39:49,444 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 294 transitions. Word has length 39 [2021-12-21 20:39:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:49,444 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 294 transitions. [2021-12-21 20:39:49,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 294 transitions. [2021-12-21 20:39:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 20:39:49,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:49,445 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:49,459 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-21 20:39:49,654 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-21 20:39:49,655 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1411098841, now seen corresponding path program 1 times [2021-12-21 20:39:49,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:49,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073537509] [2021-12-21 20:39:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:49,656 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:49,657 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-21 20:39:49,658 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-21 20:39:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 20:39:49,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:39:49,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:39:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:39:50,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:50,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073537509] [2021-12-21 20:39:50,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073537509] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:39:50,198 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:39:50,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-21 20:39:50,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844703382] [2021-12-21 20:39:50,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 20:39:50,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 20:39:50,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 20:39:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-21 20:39:50,199 INFO L87 Difference]: Start difference. First operand 261 states and 294 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:50,513 INFO L93 Difference]: Finished difference Result 269 states and 302 transitions. [2021-12-21 20:39:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 20:39:50,514 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 20:39:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:50,515 INFO L225 Difference]: With dead ends: 269 [2021-12-21 20:39:50,515 INFO L226 Difference]: Without dead ends: 269 [2021-12-21 20:39:50,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-21 20:39:50,516 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 30 mSDsluCounter, 3171 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:50,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 3441 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:39:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-21 20:39:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2021-12-21 20:39:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 179 states have (on average 1.664804469273743) internal successors, (298), 265 states have internal predecessors, (298), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 302 transitions. [2021-12-21 20:39:50,520 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 302 transitions. Word has length 39 [2021-12-21 20:39:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:50,520 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 302 transitions. [2021-12-21 20:39:50,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 302 transitions. [2021-12-21 20:39:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-21 20:39:50,521 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:50,522 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:50,534 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-21 20:39:50,727 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-21 20:39:50,727 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash 233252627, now seen corresponding path program 2 times [2021-12-21 20:39:50,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:50,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954187381] [2021-12-21 20:39:50,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:39:50,729 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:50,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:50,729 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-21 20:39:50,730 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-21 20:39:50,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:39:50,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:39:50,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 20:39:50,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:50,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 20:39:50,903 INFO L387 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-21 20:39:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:51,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:51,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:51,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954187381] [2021-12-21 20:39:51,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954187381] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:51,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:51,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:39:51,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061335454] [2021-12-21 20:39:51,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:51,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:39:51,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:51,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:39:51,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:39:51,221 INFO L87 Difference]: Start difference. First operand 269 states and 302 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:51,746 INFO L93 Difference]: Finished difference Result 284 states and 318 transitions. [2021-12-21 20:39:51,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:39:51,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-21 20:39:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:51,753 INFO L225 Difference]: With dead ends: 284 [2021-12-21 20:39:51,753 INFO L226 Difference]: Without dead ends: 284 [2021-12-21 20:39:51,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:39:51,754 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 275 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:51,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 158 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 20:39:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-21 20:39:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2021-12-21 20:39:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 179 states have (on average 1.6592178770949721) internal successors, (297), 264 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2021-12-21 20:39:51,758 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2021-12-21 20:39:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:51,758 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2021-12-21 20:39:51,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:39:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2021-12-21 20:39:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-21 20:39:51,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:51,759 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:51,769 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-21 20:39:51,959 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-21 20:39:51,960 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773764, now seen corresponding path program 1 times [2021-12-21 20:39:51,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:51,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163498066] [2021-12-21 20:39:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:51,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:51,962 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-21 20:39:51,963 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-21 20:39:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:52,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:39:52,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:52,373 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 20:39:52,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-21 20:39:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:52,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:52,398 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:52,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163498066] [2021-12-21 20:39:52,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163498066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:52,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:52,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:39:52,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995240060] [2021-12-21 20:39:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:52,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:39:52,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:52,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:39:52,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:39:52,399 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:52,753 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2021-12-21 20:39:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:39:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-12-21 20:39:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:52,756 INFO L225 Difference]: With dead ends: 279 [2021-12-21 20:39:52,756 INFO L226 Difference]: Without dead ends: 279 [2021-12-21 20:39:52,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:39:52,757 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 222 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:52,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 211 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:39:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-21 20:39:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2021-12-21 20:39:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2021-12-21 20:39:52,761 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 55 [2021-12-21 20:39:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:52,762 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2021-12-21 20:39:52,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2021-12-21 20:39:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-21 20:39:52,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:52,763 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:52,778 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-21 20:39:52,976 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-21 20:39:52,976 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1065773765, now seen corresponding path program 1 times [2021-12-21 20:39:52,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317694712] [2021-12-21 20:39:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:52,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:52,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:52,979 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-21 20:39:52,985 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-21 20:39:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:53,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 20:39:53,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:53,465 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-21 20:39:53,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 20:39:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:53,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:53,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:53,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317694712] [2021-12-21 20:39:53,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317694712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:53,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:53,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 20:39:53,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319253408] [2021-12-21 20:39:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:53,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:39:53,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:39:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:39:53,552 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:54,883 INFO L93 Difference]: Finished difference Result 443 states and 507 transitions. [2021-12-21 20:39:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:39:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-12-21 20:39:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:54,885 INFO L225 Difference]: With dead ends: 443 [2021-12-21 20:39:54,885 INFO L226 Difference]: Without dead ends: 443 [2021-12-21 20:39:54,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:39:54,886 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 642 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:54,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 779 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-21 20:39:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-12-21 20:39:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 367. [2021-12-21 20:39:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 283 states have (on average 1.7279151943462898) internal successors, (489), 362 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:39:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 495 transitions. [2021-12-21 20:39:54,891 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 495 transitions. Word has length 55 [2021-12-21 20:39:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:54,892 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 495 transitions. [2021-12-21 20:39:54,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 495 transitions. [2021-12-21 20:39:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 20:39:54,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:54,893 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:54,910 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-21 20:39:55,109 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-21 20:39:55,110 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:55,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2067963466, now seen corresponding path program 1 times [2021-12-21 20:39:55,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:55,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552461187] [2021-12-21 20:39:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:55,111 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:55,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:55,112 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-21 20:39:55,112 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-21 20:39:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:55,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 20:39:55,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:55,653 INFO L353 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2021-12-21 20:39:55,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 20:39:55,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 20:39:55,956 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-21 20:39:55,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2021-12-21 20:39:55,970 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 20:39:55,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 20:39:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:56,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:56,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:56,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552461187] [2021-12-21 20:39:56,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552461187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:56,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:56,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 20:39:56,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857795888] [2021-12-21 20:39:56,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:56,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:39:56,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:39:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:39:56,132 INFO L87 Difference]: Start difference. First operand 367 states and 495 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:56,238 INFO L93 Difference]: Finished difference Result 368 states and 496 transitions. [2021-12-21 20:39:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:39:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-12-21 20:39:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:56,240 INFO L225 Difference]: With dead ends: 368 [2021-12-21 20:39:56,240 INFO L226 Difference]: Without dead ends: 368 [2021-12-21 20:39:56,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:39:56,240 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:56,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1445 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 305 Unchecked, 0.0s Time] [2021-12-21 20:39:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-21 20:39:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-12-21 20:39:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 284 states have (on average 1.7253521126760563) internal successors, (490), 363 states have internal predecessors, (490), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:39:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 496 transitions. [2021-12-21 20:39:56,246 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 496 transitions. Word has length 58 [2021-12-21 20:39:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:56,247 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 496 transitions. [2021-12-21 20:39:56,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 496 transitions. [2021-12-21 20:39:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 20:39:56,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:56,247 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:56,264 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-21 20:39:56,459 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-21 20:39:56,459 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -317642580, now seen corresponding path program 1 times [2021-12-21 20:39:56,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:56,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235379271] [2021-12-21 20:39:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:56,461 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:56,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:56,462 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-21 20:39:56,463 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-21 20:39:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:56,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:39:56,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:56,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:56,808 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235379271] [2021-12-21 20:39:56,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235379271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:56,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:56,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:39:56,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23296486] [2021-12-21 20:39:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:56,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:39:56,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:56,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:39:56,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:39:56,810 INFO L87 Difference]: Start difference. First operand 368 states and 496 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:57,044 INFO L93 Difference]: Finished difference Result 286 states and 320 transitions. [2021-12-21 20:39:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:39:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-12-21 20:39:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:57,045 INFO L225 Difference]: With dead ends: 286 [2021-12-21 20:39:57,046 INFO L226 Difference]: Without dead ends: 286 [2021-12-21 20:39:57,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:39:57,046 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 263 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:57,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 954 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:39:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-12-21 20:39:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 264. [2021-12-21 20:39:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 260 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 297 transitions. [2021-12-21 20:39:57,050 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 297 transitions. Word has length 59 [2021-12-21 20:39:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:57,050 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 297 transitions. [2021-12-21 20:39:57,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 297 transitions. [2021-12-21 20:39:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 20:39:57,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:57,051 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:57,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-21 20:39:57,251 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-21 20:39:57,251 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1256967413, now seen corresponding path program 1 times [2021-12-21 20:39:57,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:57,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973042298] [2021-12-21 20:39:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:57,252 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:57,253 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-21 20:39:57,254 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-21 20:39:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:57,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:39:57,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:57,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:57,605 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973042298] [2021-12-21 20:39:57,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973042298] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:57,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:57,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:39:57,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601530709] [2021-12-21 20:39:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:57,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:39:57,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:39:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:39:57,606 INFO L87 Difference]: Start difference. First operand 264 states and 297 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:58,274 INFO L93 Difference]: Finished difference Result 282 states and 316 transitions. [2021-12-21 20:39:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:39:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2021-12-21 20:39:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:58,276 INFO L225 Difference]: With dead ends: 282 [2021-12-21 20:39:58,276 INFO L226 Difference]: Without dead ends: 282 [2021-12-21 20:39:58,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:39:58,277 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 277 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:58,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 631 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 20:39:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-21 20:39:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 275. [2021-12-21 20:39:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 193 states have (on average 1.61139896373057) internal successors, (311), 271 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2021-12-21 20:39:58,281 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 60 [2021-12-21 20:39:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:58,281 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2021-12-21 20:39:58,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2021-12-21 20:39:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 20:39:58,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:58,282 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:58,295 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-21 20:39:58,495 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-21 20:39:58,495 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash -311284142, now seen corresponding path program 1 times [2021-12-21 20:39:58,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:58,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978733802] [2021-12-21 20:39:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:58,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:58,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:58,497 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-21 20:39:58,498 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-21 20:39:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:39:58,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:39:58,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:39:58,982 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 20:39:58,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-21 20:39:59,007 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 20:39:59,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2021-12-21 20:39:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:39:59,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:39:59,049 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:39:59,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978733802] [2021-12-21 20:39:59,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978733802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:39:59,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:39:59,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:39:59,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723647284] [2021-12-21 20:39:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:39:59,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:39:59,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:39:59,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:39:59,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:39:59,050 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:39:59,536 INFO L93 Difference]: Finished difference Result 282 states and 322 transitions. [2021-12-21 20:39:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:39:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-12-21 20:39:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:39:59,542 INFO L225 Difference]: With dead ends: 282 [2021-12-21 20:39:59,542 INFO L226 Difference]: Without dead ends: 282 [2021-12-21 20:39:59,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:39:59,543 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 214 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 20:39:59,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 373 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 20:39:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-21 20:39:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2021-12-21 20:39:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.606060606060606) internal successors, (318), 275 states have internal predecessors, (318), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:39:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 322 transitions. [2021-12-21 20:39:59,550 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 322 transitions. Word has length 61 [2021-12-21 20:39:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:39:59,550 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 322 transitions. [2021-12-21 20:39:59,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:39:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 322 transitions. [2021-12-21 20:39:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 20:39:59,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:39:59,552 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:39:59,568 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-21 20:39:59,766 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-21 20:39:59,766 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:39:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:39:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash -311284141, now seen corresponding path program 1 times [2021-12-21 20:39:59,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:39:59,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238759037] [2021-12-21 20:39:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:39:59,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:39:59,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:39:59,769 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-21 20:39:59,770 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-21 20:40:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:00,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 20:40:00,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:00,337 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 20:40:00,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-21 20:40:00,363 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 20:40:00,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-21 20:40:00,546 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 20:40:00,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 20:40:00,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-21 20:40:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:40:00,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:40:00,734 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238759037] [2021-12-21 20:40:00,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238759037] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:40:00,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:40:00,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 20:40:00,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332776242] [2021-12-21 20:40:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:40:00,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:40:00,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:40:00,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:40:00,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:40:00,735 INFO L87 Difference]: Start difference. First operand 279 states and 322 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:40:00,846 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2021-12-21 20:40:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:40:00,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-12-21 20:40:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:40:00,849 INFO L225 Difference]: With dead ends: 279 [2021-12-21 20:40:00,849 INFO L226 Difference]: Without dead ends: 279 [2021-12-21 20:40:00,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:40:00,851 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 4 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:40:00,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1427 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 303 Unchecked, 0.0s Time] [2021-12-21 20:40:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-21 20:40:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-12-21 20:40:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.601010101010101) internal successors, (317), 275 states have internal predecessors, (317), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:40:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 321 transitions. [2021-12-21 20:40:00,860 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 321 transitions. Word has length 61 [2021-12-21 20:40:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:40:00,861 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 321 transitions. [2021-12-21 20:40:00,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 321 transitions. [2021-12-21 20:40:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-21 20:40:00,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:40:00,863 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:40:00,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-21 20:40:01,077 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-21 20:40:01,078 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:40:01,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:40:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash -631451440, now seen corresponding path program 1 times [2021-12-21 20:40:01,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:40:01,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183203863] [2021-12-21 20:40:01,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:01,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:40:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:40:01,084 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-21 20:40:01,085 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-21 20:40:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:01,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 20:40:01,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:01,649 INFO L387 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-21 20:40:01,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:01,760 INFO L353 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2021-12-21 20:40:01,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2021-12-21 20:40:01,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2021-12-21 20:40:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:40:01,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:40:01,848 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:01,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183203863] [2021-12-21 20:40:01,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183203863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:40:01,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:40:01,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:40:01,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212050529] [2021-12-21 20:40:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:40:01,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:40:01,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:40:01,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:40:01,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:40:01,849 INFO L87 Difference]: Start difference. First operand 279 states and 321 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:40:02,753 INFO L93 Difference]: Finished difference Result 277 states and 317 transitions. [2021-12-21 20:40:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:40:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-12-21 20:40:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:40:02,754 INFO L225 Difference]: With dead ends: 277 [2021-12-21 20:40:02,754 INFO L226 Difference]: Without dead ends: 277 [2021-12-21 20:40:02,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:40:02,755 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 232 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 20:40:02,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1042 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-21 20:40:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-12-21 20:40:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2021-12-21 20:40:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 273 states have internal predecessors, (313), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:40:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 317 transitions. [2021-12-21 20:40:02,758 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 317 transitions. Word has length 64 [2021-12-21 20:40:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:40:02,759 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 317 transitions. [2021-12-21 20:40:02,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 317 transitions. [2021-12-21 20:40:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-21 20:40:02,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:40:02,760 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:40:02,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-21 20:40:02,973 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-21 20:40:02,973 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:40:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:40:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash -631451439, now seen corresponding path program 1 times [2021-12-21 20:40:02,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:40:02,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236633244] [2021-12-21 20:40:02,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:02,975 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:40:02,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:40:02,975 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-21 20:40:02,976 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-21 20:40:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:03,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 20:40:03,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:03,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-21 20:40:03,566 INFO L387 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-21 20:40:03,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:03,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:03,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2021-12-21 20:40:03,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 20:40:03,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-12-21 20:40:03,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2021-12-21 20:40:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:40:03,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:40:03,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:03,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236633244] [2021-12-21 20:40:03,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236633244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:40:03,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:40:03,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:40:03,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077673783] [2021-12-21 20:40:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:40:03,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:40:03,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:40:03,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:40:03,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:40:03,746 INFO L87 Difference]: Start difference. First operand 277 states and 317 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:40:04,785 INFO L93 Difference]: Finished difference Result 276 states and 315 transitions. [2021-12-21 20:40:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:40:04,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2021-12-21 20:40:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:40:04,787 INFO L225 Difference]: With dead ends: 276 [2021-12-21 20:40:04,787 INFO L226 Difference]: Without dead ends: 276 [2021-12-21 20:40:04,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:40:04,788 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 240 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:40:04,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 734 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-21 20:40:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-21 20:40:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-12-21 20:40:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 198 states have (on average 1.5707070707070707) internal successors, (311), 272 states have internal predecessors, (311), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:40:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2021-12-21 20:40:04,792 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 64 [2021-12-21 20:40:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:40:04,792 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2021-12-21 20:40:04,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2021-12-21 20:40:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-21 20:40:04,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:40:04,793 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:40:04,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-21 20:40:05,008 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-21 20:40:05,008 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:40:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:40:05,008 INFO L85 PathProgramCache]: Analyzing trace with hash -889593477, now seen corresponding path program 1 times [2021-12-21 20:40:05,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:40:05,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971162431] [2021-12-21 20:40:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:05,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:40:05,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:40:05,010 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-21 20:40:05,011 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-21 20:40:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:05,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 20:40:05,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:05,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-21 20:40:05,750 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 20:40:05,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-21 20:40:05,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:05,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2021-12-21 20:40:05,962 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:05,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2021-12-21 20:40:06,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-21 20:40:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:40:06,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:40:06,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:06,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971162431] [2021-12-21 20:40:06,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971162431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:40:06,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:40:06,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 20:40:06,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683179384] [2021-12-21 20:40:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:40:06,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:40:06,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:40:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:40:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:40:06,087 INFO L87 Difference]: Start difference. First operand 276 states and 315 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:40:07,029 INFO L93 Difference]: Finished difference Result 297 states and 337 transitions. [2021-12-21 20:40:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:40:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-12-21 20:40:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:40:07,031 INFO L225 Difference]: With dead ends: 297 [2021-12-21 20:40:07,031 INFO L226 Difference]: Without dead ends: 297 [2021-12-21 20:40:07,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-21 20:40:07,031 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 493 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 20:40:07,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 649 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 107 Unchecked, 0.8s Time] [2021-12-21 20:40:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-21 20:40:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2021-12-21 20:40:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 281 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:40:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 330 transitions. [2021-12-21 20:40:07,036 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 330 transitions. Word has length 68 [2021-12-21 20:40:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:40:07,036 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 330 transitions. [2021-12-21 20:40:07,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 330 transitions. [2021-12-21 20:40:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-21 20:40:07,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:40:07,037 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:40:07,058 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-21 20:40:07,263 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-21 20:40:07,263 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:40:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:40:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash -889593476, now seen corresponding path program 1 times [2021-12-21 20:40:07,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:40:07,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327664127] [2021-12-21 20:40:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:07,264 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:40:07,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:40:07,265 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-21 20:40:07,268 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-21 20:40:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:07,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-21 20:40:07,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:07,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-21 20:40:07,945 INFO L387 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-21 20:40:07,956 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 20:40:07,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 20:40:07,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:07,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:08,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2021-12-21 20:40:08,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 20:40:08,189 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:08,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2021-12-21 20:40:08,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 20:40:08,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-21 20:40:08,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-12-21 20:40:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:40:08,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:40:08,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:08,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327664127] [2021-12-21 20:40:08,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327664127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:40:08,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:40:08,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 20:40:08,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159739443] [2021-12-21 20:40:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:40:08,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 20:40:08,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:40:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 20:40:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:40:08,324 INFO L87 Difference]: Start difference. First operand 285 states and 330 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:40:10,206 INFO L93 Difference]: Finished difference Result 297 states and 334 transitions. [2021-12-21 20:40:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 20:40:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-12-21 20:40:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:40:10,208 INFO L225 Difference]: With dead ends: 297 [2021-12-21 20:40:10,208 INFO L226 Difference]: Without dead ends: 297 [2021-12-21 20:40:10,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:40:10,216 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 482 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-21 20:40:10,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 669 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-21 20:40:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-21 20:40:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2021-12-21 20:40:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5555555555555556) internal successors, (322), 281 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:40:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 326 transitions. [2021-12-21 20:40:10,221 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 326 transitions. Word has length 68 [2021-12-21 20:40:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:40:10,221 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 326 transitions. [2021-12-21 20:40:10,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 326 transitions. [2021-12-21 20:40:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-21 20:40:10,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:40:10,222 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:40:10,239 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-21 20:40:10,440 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-21 20:40:10,440 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:40:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:40:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -269261804, now seen corresponding path program 1 times [2021-12-21 20:40:10,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:40:10,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195705538] [2021-12-21 20:40:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:10,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:40:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:40:10,442 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-21 20:40:10,443 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-21 20:40:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:11,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 20:40:11,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:11,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-21 20:40:11,280 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 20:40:11,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-21 20:40:11,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:11,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2021-12-21 20:40:11,476 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:11,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2021-12-21 20:40:11,575 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:11,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2021-12-21 20:40:11,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-21 20:40:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2021-12-21 20:40:11,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:40:11,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1548) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2021-12-21 20:40:11,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-21 20:40:11,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2021-12-21 20:40:12,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1548 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1546))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1547)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1548)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))) is different from false [2021-12-21 20:40:12,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:40:12,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2021-12-21 20:40:12,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2665 treesize of output 1963 [2021-12-21 20:40:12,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1959 treesize of output 1644 [2021-12-21 20:40:12,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1644 treesize of output 1294 [2021-12-21 20:40:12,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1294 treesize of output 1266 [2021-12-21 20:40:19,111 INFO L353 Elim1Store]: treesize reduction -11, result has 113.6 percent of original size [2021-12-21 20:40:19,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 219 [2021-12-21 20:40:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2021-12-21 20:40:20,246 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:20,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195705538] [2021-12-21 20:40:20,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195705538] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:40:20,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:40:20,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2021-12-21 20:40:20,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078234035] [2021-12-21 20:40:20,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 20:40:20,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 20:40:20,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 20:40:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 20:40:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2021-12-21 20:40:20,248 INFO L87 Difference]: Start difference. First operand 285 states and 326 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:40:22,010 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2021-12-21 20:40:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:40:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-12-21 20:40:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:40:22,012 INFO L225 Difference]: With dead ends: 287 [2021-12-21 20:40:22,012 INFO L226 Difference]: Without dead ends: 287 [2021-12-21 20:40:22,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=206, Unknown=8, NotChecked=132, Total=420 [2021-12-21 20:40:22,013 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 20 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 802 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:40:22,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 2318 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 802 Unchecked, 1.3s Time] [2021-12-21 20:40:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-21 20:40:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2021-12-21 20:40:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 207 states have (on average 1.5507246376811594) internal successors, (321), 281 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:40:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 325 transitions. [2021-12-21 20:40:22,017 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 325 transitions. Word has length 73 [2021-12-21 20:40:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:40:22,017 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 325 transitions. [2021-12-21 20:40:22,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:40:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 325 transitions. [2021-12-21 20:40:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-21 20:40:22,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:40:22,018 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:40:22,046 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-21 20:40:22,235 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-21 20:40:22,236 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 90 more)] === [2021-12-21 20:40:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:40:22,236 INFO L85 PathProgramCache]: Analyzing trace with hash -269261803, now seen corresponding path program 1 times [2021-12-21 20:40:22,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 20:40:22,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143765633] [2021-12-21 20:40:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:22,237 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 20:40:22,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 20:40:22,238 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-21 20:40:22,239 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-21 20:40:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:22,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 20:40:22,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:23,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-21 20:40:23,032 INFO L387 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-21 20:40:23,043 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 20:40:23,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 20:40:23,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:23,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:23,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2021-12-21 20:40:23,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 20:40:23,311 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:23,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2021-12-21 20:40:23,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 20:40:23,498 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:23,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2021-12-21 20:40:23,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 20:40:23,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-21 20:40:23,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-12-21 20:40:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-21 20:40:23,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:40:24,898 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2021-12-21 20:40:24,998 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse2 .cse3) (bvadd (_ bv1 64) .cse2 .cse3))))) is different from false [2021-12-21 20:40:25,137 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2021-12-21 20:40:25,229 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse4 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64)))))) is different from false [2021-12-21 20:40:25,496 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1678))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1679) .cse1 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1680)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2021-12-21 20:40:25,694 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse2 v_ArrVal_1679) (select (select (store .cse3 .cse2 v_ArrVal_1678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1680))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1679 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1678 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1677 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1680 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1676)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1678))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1677) .cse5 v_ArrVal_1679) .cse6 v_ArrVal_1680) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) (_ bv1 64)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1681) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2021-12-21 20:40:25,786 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:40:25,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2021-12-21 20:40:25,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:40:25,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2021-12-21 20:40:25,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5607 treesize of output 4554 [2021-12-21 20:40:25,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92771 treesize of output 89882 [2021-12-21 20:40:26,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89878 treesize of output 81366 [2021-12-21 20:40:26,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81366 treesize of output 79126 [2021-12-21 20:40:26,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79126 treesize of output 75094 [2021-12-21 20:40:26,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75094 treesize of output 64426 [2021-12-21 20:40:26,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64426 treesize of output 55914 [2021-12-21 20:40:27,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55914 treesize of output 46842 [2021-12-21 20:40:29,304 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 20:40:29,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143765633] [2021-12-21 20:40:29,305 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-21 20:40:29,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1932265172] [2021-12-21 20:40:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:40:29,305 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-21 20:40:29,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-21 20:40:29,307 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-21 20:40:29,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-12-21 20:40:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:40:30,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-21 20:40:30,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:40:30,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-21 20:40:30,844 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 20:40:30,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 20:40:30,852 INFO L387 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-21 20:40:30,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:30,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-12-21 20:40:30,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2021-12-21 20:40:30,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-12-21 20:40:31,016 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:31,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2021-12-21 20:40:31,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 20:40:31,112 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:40:31,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2021-12-21 20:40:31,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-21 20:40:31,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2021-12-21 20:40:31,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2021-12-21 20:40:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-21 20:40:31,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:40:31,595 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1814 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1814) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2021-12-21 20:40:31,708 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1814 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1814) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2021-12-21 20:40:31,865 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1814 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1814) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2021-12-21 20:40:31,951 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1811 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1812 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1814 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1811)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1812) .cse0 v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1814) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1811 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1812 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1812) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 (_ bv1 64) .cse4))))) is different from false [2021-12-21 20:40:32,345 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1811 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1812 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1814 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1811))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1812) .cse1 v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1814) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1811 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1812 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 ((_ sign_extend 32) (_ bv1 32))) (.cse5 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1812) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1811) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1813)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 (_ bv1 64) .cse5))))) is different from false [2021-12-21 20:40:32,643 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1811 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1810 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1812 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1809 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1809) .cse2 v_ArrVal_1812) (select (select (store .cse3 .cse2 v_ArrVal_1811) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1813))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1811 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1810 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1813 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1812 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1809 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1814 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1810)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1811))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1809) .cse5 v_ArrVal_1812) .cse6 v_ArrVal_1813) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1814) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2021-12-21 20:40:32,726 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:40:32,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2021-12-21 20:40:32,743 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:40:32,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2021-12-21 20:40:32,754 INFO L387 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 10779 treesize of output 8754 [2021-12-21 20:40:32,794 INFO L387 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 91883 treesize of output 89138 [2021-12-21 20:40:33,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89134 treesize of output 81518 [2021-12-21 20:40:33,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81518 treesize of output 79390 [2021-12-21 20:40:33,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79390 treesize of output 64270 [2021-12-21 20:40:33,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64270 treesize of output 56654 [2021-12-21 20:40:33,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56654 treesize of output 45790 [2021-12-21 20:40:33,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45790 treesize of output 42430