./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version ae007674 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/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:41:08,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:41:08,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:41:08,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:41:08,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:41:08,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:41:08,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:41:08,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:41:08,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:41:08,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:41:08,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:41:08,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:41:08,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:41:08,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:41:08,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:41:08,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:41:08,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:41:08,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:41:08,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:41:08,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:41:08,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:41:08,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:41:08,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:41:08,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:41:08,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:41:08,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:41:08,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:41:08,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:41:08,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:41:08,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:41:08,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:41:08,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:41:08,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:41:08,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:41:08,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:41:08,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:41:08,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:41:08,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:41:08,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:41:08,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:41:08,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:41:08,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-28 05:41:08,710 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:41:08,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:41:08,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:41:08,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:41:08,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:41:08,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:41:08,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:41:08,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:41:08,714 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:41:08,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:41:08,715 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:41:08,715 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:41:08,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:41:08,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:41:08,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:41:08,716 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:41:08,716 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:41:08,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:41:08,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:41:08,717 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:41:08,717 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:41:08,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:41:08,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:41:08,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:41:08,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:08,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:41:08,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:41:08,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:41:08,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:41:08,718 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2021-12-28 05:41:08,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:41:08,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:41:08,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:41:08,981 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:41:08,983 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:41:08,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-28 05:41:09,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0a553e4/ffd26882b9884440b67dd4bd7946e605/FLAGff80d91ee [2021-12-28 05:41:09,492 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:41:09,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-28 05:41:09,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0a553e4/ffd26882b9884440b67dd4bd7946e605/FLAGff80d91ee [2021-12-28 05:41:09,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be0a553e4/ffd26882b9884440b67dd4bd7946e605 [2021-12-28 05:41:09,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:41:09,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:41:09,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:09,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:41:09,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:41:09,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a0582d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09, skipping insertion in model container [2021-12-28 05:41:09,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:41:09,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:41:09,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/forester-heap/sll-queue-2.i[22387,22400] [2021-12-28 05:41:09,784 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/forester-heap/sll-queue-2.i[22458,22471] [2021-12-28 05:41:09,784 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/forester-heap/sll-queue-2.i[22532,22545] [2021-12-28 05:41:09,786 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/forester-heap/sll-queue-2.i[22624,22637] [2021-12-28 05:41:09,787 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/forester-heap/sll-queue-2.i[22701,22714] [2021-12-28 05:41:09,789 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/forester-heap/sll-queue-2.i[22796,22809] [2021-12-28 05:41:09,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2021-12-28 05:41:09,791 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/forester-heap/sll-queue-2.i[22956,22969] [2021-12-28 05:41:09,792 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/forester-heap/sll-queue-2.i[23051,23064] [2021-12-28 05:41:09,794 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/forester-heap/sll-queue-2.i[23128,23141] [2021-12-28 05:41:09,795 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/forester-heap/sll-queue-2.i[23211,23224] [2021-12-28 05:41:09,796 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/forester-heap/sll-queue-2.i[23300,23313] [2021-12-28 05:41:09,797 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/forester-heap/sll-queue-2.i[23386,23399] [2021-12-28 05:41:09,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2021-12-28 05:41:09,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:09,815 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:41:09,837 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/forester-heap/sll-queue-2.i[22387,22400] [2021-12-28 05:41:09,838 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/forester-heap/sll-queue-2.i[22458,22471] [2021-12-28 05:41:09,839 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/forester-heap/sll-queue-2.i[22532,22545] [2021-12-28 05:41:09,839 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/forester-heap/sll-queue-2.i[22624,22637] [2021-12-28 05:41:09,840 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/forester-heap/sll-queue-2.i[22701,22714] [2021-12-28 05:41:09,840 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/forester-heap/sll-queue-2.i[22796,22809] [2021-12-28 05:41:09,841 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/forester-heap/sll-queue-2.i[22873,22886] [2021-12-28 05:41:09,841 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/forester-heap/sll-queue-2.i[22956,22969] [2021-12-28 05:41:09,842 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/forester-heap/sll-queue-2.i[23051,23064] [2021-12-28 05:41:09,844 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/forester-heap/sll-queue-2.i[23128,23141] [2021-12-28 05:41:09,844 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/forester-heap/sll-queue-2.i[23211,23224] [2021-12-28 05:41:09,846 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/forester-heap/sll-queue-2.i[23300,23313] [2021-12-28 05:41:09,847 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/forester-heap/sll-queue-2.i[23386,23399] [2021-12-28 05:41:09,848 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/forester-heap/sll-queue-2.i[23532,23545] [2021-12-28 05:41:09,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:09,872 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:41:09,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09 WrapperNode [2021-12-28 05:41:09,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:09,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:09,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:41:09,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:41:09,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,916 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2021-12-28 05:41:09,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:09,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:09,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:09,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:09,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:09,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:09,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:09,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:09,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (1/1) ... [2021-12-28 05:41:09,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:09,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:10,007 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-28 05:41:10,024 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-28 05:41:10,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:41:10,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:10,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:10,167 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:10,168 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:10,513 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:10,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:10,520 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-12-28 05:41:10,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:10 BoogieIcfgContainer [2021-12-28 05:41:10,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:10,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:10,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:10,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:10,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:41:09" (1/3) ... [2021-12-28 05:41:10,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e06584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:10, skipping insertion in model container [2021-12-28 05:41:10,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:09" (2/3) ... [2021-12-28 05:41:10,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e06584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:10, skipping insertion in model container [2021-12-28 05:41:10,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:10" (3/3) ... [2021-12-28 05:41:10,530 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2021-12-28 05:41:10,534 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:10,534 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-12-28 05:41:10,564 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:10,572 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-28 05:41:10,572 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-12-28 05:41:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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-28 05:41:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:10,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:10,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:10,601 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:41:10,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:10,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642966023] [2021-12-28 05:41:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:10,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:10,724 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-28 05:41:10,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:10,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642966023] [2021-12-28 05:41:10,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642966023] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:10,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:10,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:10,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124625357] [2021-12-28 05:41:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:10,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:10,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:10,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:10,773 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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) 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-28 05:41:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:10,952 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2021-12-28 05:41:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:10,954 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-28 05:41:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:10,963 INFO L225 Difference]: With dead ends: 169 [2021-12-28 05:41:10,964 INFO L226 Difference]: Without dead ends: 165 [2021-12-28 05:41:10,966 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-28 05:41:10,971 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:10,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-28 05:41:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2021-12-28 05:41:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 states have internal predecessors, (173), 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-28 05:41:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2021-12-28 05:41:11,023 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2021-12-28 05:41:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:11,023 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2021-12-28 05:41:11,024 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-28 05:41:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2021-12-28 05:41:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:11,025 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:11,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:11,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:41:11,025 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:11,027 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:41:11,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422961063] [2021-12-28 05:41:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:11,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:11,098 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-28 05:41:11,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422961063] [2021-12-28 05:41:11,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422961063] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:11,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:11,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:11,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969329733] [2021-12-28 05:41:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:11,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:11,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:11,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:11,105 INFO L87 Difference]: Start difference. First operand 161 states and 173 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-28 05:41:11,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:11,198 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2021-12-28 05:41:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:11,199 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-28 05:41:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:11,206 INFO L225 Difference]: With dead ends: 155 [2021-12-28 05:41:11,206 INFO L226 Difference]: Without dead ends: 155 [2021-12-28 05:41:11,207 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-28 05:41:11,208 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:11,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-28 05:41:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2021-12-28 05:41:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 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-28 05:41:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2021-12-28 05:41:11,220 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2021-12-28 05:41:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:11,220 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2021-12-28 05:41:11,221 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-28 05:41:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2021-12-28 05:41:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:41:11,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:11,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:11,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:41:11,222 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-28 05:41:11,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:11,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247461618] [2021-12-28 05:41:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:11,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:11,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:11,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247461618] [2021-12-28 05:41:11,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247461618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:11,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:11,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:11,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119157474] [2021-12-28 05:41:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:11,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:11,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:11,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:11,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:11,270 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:11,356 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2021-12-28 05:41:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-28 05:41:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:11,357 INFO L225 Difference]: With dead ends: 161 [2021-12-28 05:41:11,357 INFO L226 Difference]: Without dead ends: 161 [2021-12-28 05:41:11,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:11,358 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:11,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-28 05:41:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2021-12-28 05:41:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 states have internal predecessors, (168), 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-28 05:41:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2021-12-28 05:41:11,363 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2021-12-28 05:41:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:11,364 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2021-12-28 05:41:11,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2021-12-28 05:41:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:41:11,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:11,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:11,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:41:11,365 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-28 05:41:11,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:11,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331885718] [2021-12-28 05:41:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:11,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:11,410 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-28 05:41:11,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:11,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331885718] [2021-12-28 05:41:11,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331885718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:11,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:11,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:11,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072739850] [2021-12-28 05:41:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:11,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:11,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:11,412 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:11,550 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-12-28 05:41:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-28 05:41:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:11,551 INFO L225 Difference]: With dead ends: 244 [2021-12-28 05:41:11,552 INFO L226 Difference]: Without dead ends: 244 [2021-12-28 05:41:11,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:11,555 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:11,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-28 05:41:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2021-12-28 05:41:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 states have internal predecessors, (173), 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-28 05:41:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2021-12-28 05:41:11,572 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2021-12-28 05:41:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:11,573 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2021-12-28 05:41:11,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2021-12-28 05:41:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:41:11,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:11,574 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:11,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:41:11,574 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:11,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2021-12-28 05:41:11,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:11,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337396388] [2021-12-28 05:41:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:11,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:11,628 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-28 05:41:11,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:11,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337396388] [2021-12-28 05:41:11,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337396388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:11,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:11,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:11,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558230752] [2021-12-28 05:41:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:11,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:11,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:11,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:11,630 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-28 05:41:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:11,654 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2021-12-28 05:41:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2021-12-28 05:41:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:11,655 INFO L225 Difference]: With dead ends: 148 [2021-12-28 05:41:11,655 INFO L226 Difference]: Without dead ends: 148 [2021-12-28 05:41:11,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:41:11,656 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:11,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-28 05:41:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-28 05:41:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 states have internal predecessors, (162), 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-28 05:41:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2021-12-28 05:41:11,662 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2021-12-28 05:41:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:11,662 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2021-12-28 05:41:11,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-28 05:41:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2021-12-28 05:41:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:41:11,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:11,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:11,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:41:11,663 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-28 05:41:11,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742203102] [2021-12-28 05:41:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:11,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:11,725 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-28 05:41:11,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742203102] [2021-12-28 05:41:11,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742203102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:11,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:11,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:11,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881864234] [2021-12-28 05:41:11,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:11,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:11,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:11,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:11,728 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:11,930 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2021-12-28 05:41:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:41:11,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-28 05:41:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:11,931 INFO L225 Difference]: With dead ends: 219 [2021-12-28 05:41:11,932 INFO L226 Difference]: Without dead ends: 219 [2021-12-28 05:41:11,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:11,933 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:11,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-28 05:41:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2021-12-28 05:41:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 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-28 05:41:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2021-12-28 05:41:11,936 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2021-12-28 05:41:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:11,936 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2021-12-28 05:41:11,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2021-12-28 05:41:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:41:11,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:11,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:11,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:41:11,939 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:11,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-28 05:41:11,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866451700] [2021-12-28 05:41:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:11,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:11,994 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-28 05:41:11,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:11,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866451700] [2021-12-28 05:41:11,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866451700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:11,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:11,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:11,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588512240] [2021-12-28 05:41:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:11,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:11,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:11,996 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:12,205 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2021-12-28 05:41:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:41:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-28 05:41:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:12,207 INFO L225 Difference]: With dead ends: 211 [2021-12-28 05:41:12,207 INFO L226 Difference]: Without dead ends: 211 [2021-12-28 05:41:12,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:12,207 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:12,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:12,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-28 05:41:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2021-12-28 05:41:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 states have internal predecessors, (149), 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-28 05:41:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2021-12-28 05:41:12,210 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2021-12-28 05:41:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:12,210 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2021-12-28 05:41:12,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2021-12-28 05:41:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:41:12,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:12,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:12,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:41:12,211 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2021-12-28 05:41:12,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:12,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138306061] [2021-12-28 05:41:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:12,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:12,245 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-28 05:41:12,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138306061] [2021-12-28 05:41:12,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138306061] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:12,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:12,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:12,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689544459] [2021-12-28 05:41:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:12,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:12,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:12,250 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:12,265 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-28 05:41:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-28 05:41:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:12,267 INFO L225 Difference]: With dead ends: 191 [2021-12-28 05:41:12,267 INFO L226 Difference]: Without dead ends: 191 [2021-12-28 05:41:12,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:41:12,268 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:12,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-28 05:41:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2021-12-28 05:41:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 states have internal predecessors, (163), 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-28 05:41:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2021-12-28 05:41:12,271 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2021-12-28 05:41:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:12,271 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2021-12-28 05:41:12,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2021-12-28 05:41:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:41:12,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:12,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:12,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:41:12,273 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2021-12-28 05:41:12,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:12,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461818889] [2021-12-28 05:41:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:12,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:12,334 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-28 05:41:12,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:12,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461818889] [2021-12-28 05:41:12,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461818889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:12,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:12,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:41:12,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316351107] [2021-12-28 05:41:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:12,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:12,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:12,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:12,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:12,336 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-28 05:41:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:12,410 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2021-12-28 05:41:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:41:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 19 [2021-12-28 05:41:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:12,411 INFO L225 Difference]: With dead ends: 149 [2021-12-28 05:41:12,411 INFO L226 Difference]: Without dead ends: 149 [2021-12-28 05:41:12,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:12,413 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:12,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-28 05:41:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2021-12-28 05:41:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 states have internal predecessors, (161), 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-28 05:41:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2021-12-28 05:41:12,417 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2021-12-28 05:41:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:12,418 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2021-12-28 05:41:12,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-28 05:41:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2021-12-28 05:41:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:41:12,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:12,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:12,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:41:12,420 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2021-12-28 05:41:12,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741882832] [2021-12-28 05:41:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:12,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:12,490 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-28 05:41:12,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741882832] [2021-12-28 05:41:12,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741882832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:12,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:12,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:41:12,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791663563] [2021-12-28 05:41:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:12,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:12,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:12,492 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:12,572 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-12-28 05:41:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:41:12,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-28 05:41:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:12,574 INFO L225 Difference]: With dead ends: 156 [2021-12-28 05:41:12,574 INFO L226 Difference]: Without dead ends: 156 [2021-12-28 05:41:12,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:12,574 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:12,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-28 05:41:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2021-12-28 05:41:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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-28 05:41:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-12-28 05:41:12,577 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2021-12-28 05:41:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:12,578 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-12-28 05:41:12,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-12-28 05:41:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:41:12,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:12,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:12,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:41:12,580 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2021-12-28 05:41:12,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:12,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057847175] [2021-12-28 05:41:12,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:12,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:12,612 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-28 05:41:12,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:12,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057847175] [2021-12-28 05:41:12,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057847175] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:12,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:12,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:12,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965220589] [2021-12-28 05:41:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:12,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:12,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:12,614 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:41:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:12,677 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2021-12-28 05:41:12,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:12,678 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), 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 22 [2021-12-28 05:41:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:12,681 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:41:12,681 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:41:12,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:12,682 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:12,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:41:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-28 05:41:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 states have internal predecessors, (165), 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-28 05:41:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2021-12-28 05:41:12,685 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2021-12-28 05:41:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:12,685 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2021-12-28 05:41:12,685 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), 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-28 05:41:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2021-12-28 05:41:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:41:12,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:12,686 INFO L514 BasicCegarLoop]: trace histogram [2, 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-28 05:41:12,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:41:12,686 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2021-12-28 05:41:12,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:12,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453282104] [2021-12-28 05:41:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:12,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:12,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:12,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453282104] [2021-12-28 05:41:12,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453282104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503377395] [2021-12-28 05:41:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:12,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:12,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:12,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:41:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:12,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-28 05:41:12,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:12,929 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 15 treesize of output 7 [2021-12-28 05:41:12,932 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 15 treesize of output 7 [2021-12-28 05:41:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:12,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:13,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503377395] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:13,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:13,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2021-12-28 05:41:13,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738181248] [2021-12-28 05:41:13,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:13,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:41:13,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:41:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:41:13,064 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-28 05:41:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:13,324 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2021-12-28 05:41:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:41:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 25 [2021-12-28 05:41:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:13,326 INFO L225 Difference]: With dead ends: 181 [2021-12-28 05:41:13,326 INFO L226 Difference]: Without dead ends: 181 [2021-12-28 05:41:13,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:41:13,327 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 155 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:13,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-28 05:41:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2021-12-28 05:41:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 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-28 05:41:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2021-12-28 05:41:13,330 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2021-12-28 05:41:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:13,331 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2021-12-28 05:41:13,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-28 05:41:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2021-12-28 05:41:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:41:13,333 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:13,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:13,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:41:13,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-28 05:41:13,552 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:13,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2021-12-28 05:41:13,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:13,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835844710] [2021-12-28 05:41:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:13,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:13,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835844710] [2021-12-28 05:41:13,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835844710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946953286] [2021-12-28 05:41:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:13,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:13,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:13,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 05:41:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:13,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:41:13,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:13,715 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 13 treesize of output 9 [2021-12-28 05:41:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:13,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:13,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946953286] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:13,787 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:13,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-28 05:41:13,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716558757] [2021-12-28 05:41:13,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:13,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:13,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:13,789 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-28 05:41:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:13,891 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2021-12-28 05:41:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:13,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 26 [2021-12-28 05:41:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:13,894 INFO L225 Difference]: With dead ends: 172 [2021-12-28 05:41:13,894 INFO L226 Difference]: Without dead ends: 153 [2021-12-28 05:41:13,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:41:13,895 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:13,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-28 05:41:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-28 05:41:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 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-28 05:41:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2021-12-28 05:41:13,898 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2021-12-28 05:41:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:13,898 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2021-12-28 05:41:13,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-28 05:41:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2021-12-28 05:41:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 05:41:13,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:13,899 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 05:41:13,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:14,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-28 05:41:14,118 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2021-12-28 05:41:14,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102783885] [2021-12-28 05:41:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:14,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:14,244 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-28 05:41:14,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:14,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102783885] [2021-12-28 05:41:14,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102783885] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:14,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389990876] [2021-12-28 05:41:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:14,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:14,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:14,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 05:41:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:14,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-28 05:41:14,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:14,352 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-28 05:41:14,411 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:14,412 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-28 05:41:14,457 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 11 treesize of output 7 [2021-12-28 05:41:14,552 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:14,553 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 30 treesize of output 28 [2021-12-28 05:41:14,580 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:14,580 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 27 treesize of output 28 [2021-12-28 05:41:14,665 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 24 treesize of output 12 [2021-12-28 05:41:14,669 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-28 05:41:14,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:14,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:14,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:14,737 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:41:14,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:14,749 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 19 treesize of output 20 [2021-12-28 05:41:14,767 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:14,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-28 05:41:14,771 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 20 treesize of output 18 [2021-12-28 05:41:14,899 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-28 05:41:14,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389990876] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:14,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:14,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-28 05:41:14,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995233210] [2021-12-28 05:41:14,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:14,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-28 05:41:14,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-28 05:41:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2021-12-28 05:41:14,901 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-28 05:41:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:15,512 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2021-12-28 05:41:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:41:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 29 [2021-12-28 05:41:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:15,514 INFO L225 Difference]: With dead ends: 281 [2021-12-28 05:41:15,514 INFO L226 Difference]: Without dead ends: 281 [2021-12-28 05:41:15,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2021-12-28 05:41:15,514 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 527 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:15,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 1402 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 901 Invalid, 0 Unknown, 531 Unchecked, 0.3s Time] [2021-12-28 05:41:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-28 05:41:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2021-12-28 05:41:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 states have internal predecessors, (183), 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-28 05:41:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2021-12-28 05:41:15,517 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2021-12-28 05:41:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:15,517 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2021-12-28 05:41:15,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-28 05:41:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2021-12-28 05:41:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 05:41:15,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:15,518 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 05:41:15,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:15,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:15,718 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2021-12-28 05:41:15,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:15,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062996577] [2021-12-28 05:41:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:15,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:15,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:15,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062996577] [2021-12-28 05:41:15,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062996577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:15,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:15,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:15,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994191821] [2021-12-28 05:41:15,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:15,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:15,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:15,748 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-28 05:41:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:15,766 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2021-12-28 05:41:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2021-12-28 05:41:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:15,767 INFO L225 Difference]: With dead ends: 239 [2021-12-28 05:41:15,767 INFO L226 Difference]: Without dead ends: 239 [2021-12-28 05:41:15,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:41:15,768 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:15,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-28 05:41:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2021-12-28 05:41:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 states have internal predecessors, (201), 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-28 05:41:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2021-12-28 05:41:15,771 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2021-12-28 05:41:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:15,771 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2021-12-28 05:41:15,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-28 05:41:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2021-12-28 05:41:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 05:41:15,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:15,772 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:15,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:41:15,772 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2021-12-28 05:41:15,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630088468] [2021-12-28 05:41:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:15,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:15,915 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-28 05:41:15,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630088468] [2021-12-28 05:41:15,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630088468] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:15,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867047375] [2021-12-28 05:41:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:15,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:15,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:15,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 05:41:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:15,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 05:41:15,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:15,999 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-28 05:41:16,068 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:41:16,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:41:16,099 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 11 treesize of output 7 [2021-12-28 05:41:16,202 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:16,202 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 31 treesize of output 29 [2021-12-28 05:41:16,234 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:16,235 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 28 treesize of output 29 [2021-12-28 05:41:16,402 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 13 [2021-12-28 05:41:16,482 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-28 05:41:16,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:16,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-28 05:41:16,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-28 05:41:16,601 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:16,601 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 20 treesize of output 21 [2021-12-28 05:41:16,606 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:16,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-28 05:41:16,609 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-28 05:41:18,930 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-28 05:41:18,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867047375] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:18,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:18,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2021-12-28 05:41:18,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703041215] [2021-12-28 05:41:18,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:18,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 05:41:18,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 05:41:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=8, NotChecked=106, Total=870 [2021-12-28 05:41:18,932 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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-28 05:41:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:19,449 INFO L93 Difference]: Finished difference Result 245 states and 270 transitions. [2021-12-28 05:41:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 05:41:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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-28 05:41:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:19,450 INFO L225 Difference]: With dead ends: 245 [2021-12-28 05:41:19,451 INFO L226 Difference]: Without dead ends: 245 [2021-12-28 05:41:19,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=310, Invalid=1172, Unknown=8, NotChecked=150, Total=1640 [2021-12-28 05:41:19,451 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 126 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 593 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:19,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 1441 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 587 Invalid, 0 Unknown, 593 Unchecked, 0.3s Time] [2021-12-28 05:41:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-28 05:41:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 197. [2021-12-28 05:41:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 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-28 05:41:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2021-12-28 05:41:19,454 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2021-12-28 05:41:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:19,454 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2021-12-28 05:41:19,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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-28 05:41:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2021-12-28 05:41:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 05:41:19,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:19,455 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:19,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:19,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-28 05:41:19,671 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2021-12-28 05:41:19,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:19,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421056933] [2021-12-28 05:41:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:19,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:19,863 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-28 05:41:19,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:19,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421056933] [2021-12-28 05:41:19,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421056933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:19,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522724912] [2021-12-28 05:41:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:19,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:19,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:19,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:19,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 05:41:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:19,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-28 05:41:19,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:19,953 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-28 05:41:20,004 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:20,007 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-28 05:41:20,013 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-28 05:41:20,047 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 11 treesize of output 7 [2021-12-28 05:41:20,055 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 11 treesize of output 7 [2021-12-28 05:41:20,168 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:41:20,168 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 14 treesize of output 20 [2021-12-28 05:41:20,173 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 5 treesize of output 3 [2021-12-28 05:41:20,185 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:20,185 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 31 treesize of output 29 [2021-12-28 05:41:20,234 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:20,235 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 38 treesize of output 37 [2021-12-28 05:41:20,238 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 18 treesize of output 20 [2021-12-28 05:41:20,402 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 13 [2021-12-28 05:41:20,405 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 15 treesize of output 7 [2021-12-28 05:41:20,461 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-28 05:41:20,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:20,635 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-28 05:41:20,656 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2021-12-28 05:41:20,664 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-28 05:41:20,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:20,677 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 20 treesize of output 21 [2021-12-28 05:41:20,682 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:20,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-28 05:41:20,685 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-28 05:41:20,713 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:20,714 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 37 treesize of output 38 [2021-12-28 05:41:20,718 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:20,718 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-28 05:41:20,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:20,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-28 05:41:20,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:20,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-28 05:41:20,828 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-28 05:41:20,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522724912] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:20,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:20,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2021-12-28 05:41:20,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089323071] [2021-12-28 05:41:20,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:20,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-28 05:41:20,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-28 05:41:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2021-12-28 05:41:20,830 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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-28 05:41:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:22,332 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2021-12-28 05:41:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-28 05:41:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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-28 05:41:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:22,334 INFO L225 Difference]: With dead ends: 325 [2021-12-28 05:41:22,334 INFO L226 Difference]: Without dead ends: 325 [2021-12-28 05:41:22,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=471, Invalid=2294, Unknown=3, NotChecked=312, Total=3080 [2021-12-28 05:41:22,337 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 866 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 878 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:22,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [866 Valid, 1125 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1331 Invalid, 0 Unknown, 878 Unchecked, 0.6s Time] [2021-12-28 05:41:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-28 05:41:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 201. [2021-12-28 05:41:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.301775147928994) internal successors, (220), 200 states have internal predecessors, (220), 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-28 05:41:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2021-12-28 05:41:22,344 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2021-12-28 05:41:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:22,344 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2021-12-28 05:41:22,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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-28 05:41:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2021-12-28 05:41:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-28 05:41:22,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:22,345 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:22,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-28 05:41:22,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-28 05:41:22,552 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:22,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2021-12-28 05:41:22,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:22,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666147793] [2021-12-28 05:41:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:22,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:41:22,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666147793] [2021-12-28 05:41:22,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666147793] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:22,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:22,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:22,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456747975] [2021-12-28 05:41:22,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:22,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:22,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:22,604 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-28 05:41:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:22,610 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2021-12-28 05:41:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 40 [2021-12-28 05:41:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:22,611 INFO L225 Difference]: With dead ends: 202 [2021-12-28 05:41:22,611 INFO L226 Difference]: Without dead ends: 202 [2021-12-28 05:41:22,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:41:22,611 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:22,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-28 05:41:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-12-28 05:41:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 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-28 05:41:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2021-12-28 05:41:22,614 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2021-12-28 05:41:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:22,615 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2021-12-28 05:41:22,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-28 05:41:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2021-12-28 05:41:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:41:22,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:22,615 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:22,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:41:22,616 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2021-12-28 05:41:22,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:22,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970837959] [2021-12-28 05:41:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:22,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:22,920 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-28 05:41:22,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:22,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970837959] [2021-12-28 05:41:22,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970837959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:22,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856575474] [2021-12-28 05:41:22,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:22,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:22,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:22,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 05:41:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:23,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-28 05:41:23,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:23,025 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-28 05:41:23,055 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:23,055 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-28 05:41:23,063 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-28 05:41:23,091 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 11 treesize of output 7 [2021-12-28 05:41:23,098 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 11 treesize of output 7 [2021-12-28 05:41:23,204 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:23,205 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 31 treesize of output 29 [2021-12-28 05:41:23,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:23,213 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 14 treesize of output 16 [2021-12-28 05:41:23,273 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:23,274 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 70 treesize of output 63 [2021-12-28 05:41:23,279 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 21 treesize of output 13 [2021-12-28 05:41:23,282 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 18 treesize of output 20 [2021-12-28 05:41:23,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 9 [2021-12-28 05:41:23,561 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 29 treesize of output 17 [2021-12-28 05:41:23,564 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 15 treesize of output 7 [2021-12-28 05:41:23,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:23,663 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:23,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-28 05:41:23,682 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-28 05:41:23,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:23,804 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 80 treesize of output 60 [2021-12-28 05:41:24,043 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:24,044 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 22 treesize of output 23 [2021-12-28 05:41:24,049 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:24,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2021-12-28 05:41:24,053 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 13 treesize of output 11 [2021-12-28 05:41:24,082 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 05:41:24,082 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 18 treesize of output 1 [2021-12-28 05:41:24,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:24,090 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 18 treesize of output 19 [2021-12-28 05:41:24,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:24,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:24,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:24,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-28 05:41:24,200 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-28 05:41:24,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856575474] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:24,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:24,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2021-12-28 05:41:24,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753927352] [2021-12-28 05:41:24,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:24,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-28 05:41:24,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:24,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-28 05:41:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2021-12-28 05:41:24,202 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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-28 05:41:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:25,470 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2021-12-28 05:41:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-28 05:41:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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 42 [2021-12-28 05:41:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:25,471 INFO L225 Difference]: With dead ends: 315 [2021-12-28 05:41:25,471 INFO L226 Difference]: Without dead ends: 315 [2021-12-28 05:41:25,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=394, Invalid=2798, Unknown=0, NotChecked=0, Total=3192 [2021-12-28 05:41:25,472 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 435 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 717 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:25,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 2331 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1237 Invalid, 0 Unknown, 717 Unchecked, 0.5s Time] [2021-12-28 05:41:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-12-28 05:41:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2021-12-28 05:41:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 200 states have internal predecessors, (218), 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-28 05:41:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2021-12-28 05:41:25,475 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2021-12-28 05:41:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:25,476 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2021-12-28 05:41:25,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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-28 05:41:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2021-12-28 05:41:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:41:25,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:25,476 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:25,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:25,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:25,693 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2021-12-28 05:41:25,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:25,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055986834] [2021-12-28 05:41:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:25,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:25,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:25,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055986834] [2021-12-28 05:41:25,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055986834] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:25,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435608840] [2021-12-28 05:41:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:25,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:25,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:25,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:25,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 05:41:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:25,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-28 05:41:25,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:25,934 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-28 05:41:25,998 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:41:25,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:41:26,029 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 11 treesize of output 7 [2021-12-28 05:41:26,126 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:26,127 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 31 treesize of output 29 [2021-12-28 05:41:26,155 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:26,156 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 28 treesize of output 29 [2021-12-28 05:41:26,362 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 13 [2021-12-28 05:41:26,409 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 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-28 05:41:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:26,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:26,538 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-28 05:41:26,556 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2021-12-28 05:41:26,563 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2021-12-28 05:41:26,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:26,574 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 19 treesize of output 20 [2021-12-28 05:41:26,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:26,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-28 05:41:26,582 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 20 treesize of output 18 [2021-12-28 05:41:26,600 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:26,602 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-28 05:41:26,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:26,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:26,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:26,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-28 05:41:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:26,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435608840] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:26,694 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:26,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2021-12-28 05:41:26,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070899770] [2021-12-28 05:41:26,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:26,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-28 05:41:26,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-28 05:41:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2021-12-28 05:41:26,696 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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-28 05:41:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:27,192 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2021-12-28 05:41:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 05:41:27,193 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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 44 [2021-12-28 05:41:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:27,194 INFO L225 Difference]: With dead ends: 247 [2021-12-28 05:41:27,194 INFO L226 Difference]: Without dead ends: 247 [2021-12-28 05:41:27,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2021-12-28 05:41:27,194 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 306 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 685 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:27,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 1103 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 870 Invalid, 0 Unknown, 685 Unchecked, 0.3s Time] [2021-12-28 05:41:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-28 05:41:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2021-12-28 05:41:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 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-28 05:41:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2021-12-28 05:41:27,197 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2021-12-28 05:41:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:27,197 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2021-12-28 05:41:27,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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-28 05:41:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2021-12-28 05:41:27,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:41:27,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:27,198 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:27,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:27,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:27,398 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2021-12-28 05:41:27,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:27,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069844657] [2021-12-28 05:41:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:27,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:27,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069844657] [2021-12-28 05:41:27,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069844657] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546735047] [2021-12-28 05:41:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:27,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:27,546 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:27,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 05:41:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:27,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-28 05:41:27,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:27,648 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-28 05:41:27,696 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-28 05:41:27,704 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:27,704 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-28 05:41:27,729 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 11 treesize of output 7 [2021-12-28 05:41:27,736 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 11 treesize of output 7 [2021-12-28 05:41:27,836 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:41:27,836 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 14 treesize of output 20 [2021-12-28 05:41:27,842 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 5 treesize of output 3 [2021-12-28 05:41:27,856 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:27,856 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 31 treesize of output 29 [2021-12-28 05:41:27,905 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:27,906 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 38 treesize of output 37 [2021-12-28 05:41:27,909 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 18 treesize of output 20 [2021-12-28 05:41:28,130 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 13 [2021-12-28 05:41:28,134 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 15 treesize of output 7 [2021-12-28 05:41:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:28,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:28,373 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:41:28,389 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-28 05:41:28,396 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:41:28,419 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,419 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 37 treesize of output 38 [2021-12-28 05:41:28,423 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,423 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 29 treesize of output 30 [2021-12-28 05:41:28,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2021-12-28 05:41:28,439 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2021-12-28 05:41:28,443 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 34 treesize of output 30 [2021-12-28 05:41:28,446 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 62 treesize of output 58 [2021-12-28 05:41:28,524 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,524 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 18 treesize of output 19 [2021-12-28 05:41:28,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:28,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-28 05:41:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:28,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546735047] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:28,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:28,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2021-12-28 05:41:28,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446612980] [2021-12-28 05:41:28,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:28,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-28 05:41:28,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:28,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-28 05:41:28,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2021-12-28 05:41:28,624 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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-28 05:41:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,342 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2021-12-28 05:41:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:41:29,342 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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 44 [2021-12-28 05:41:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,343 INFO L225 Difference]: With dead ends: 247 [2021-12-28 05:41:29,343 INFO L226 Difference]: Without dead ends: 247 [2021-12-28 05:41:29,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2021-12-28 05:41:29,344 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 915 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 500 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 963 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 838 Invalid, 0 Unknown, 500 Unchecked, 0.3s Time] [2021-12-28 05:41:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-28 05:41:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2021-12-28 05:41:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 223 states have internal predecessors, (251), 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-28 05:41:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2021-12-28 05:41:29,347 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2021-12-28 05:41:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,347 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2021-12-28 05:41:29,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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-28 05:41:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2021-12-28 05:41:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:41:29,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,348 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:29,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:29,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-28 05:41:29,566 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2021-12-28 05:41:29,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498550486] [2021-12-28 05:41:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 05:41:29,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498550486] [2021-12-28 05:41:29,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498550486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:29,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:29,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:29,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595976343] [2021-12-28 05:41:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:29,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:29,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:29,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:29,623 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-28 05:41:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:29,640 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2021-12-28 05:41:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 44 [2021-12-28 05:41:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:29,642 INFO L225 Difference]: With dead ends: 298 [2021-12-28 05:41:29,642 INFO L226 Difference]: Without dead ends: 298 [2021-12-28 05:41:29,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-28 05:41:29,642 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:29,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-12-28 05:41:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2021-12-28 05:41:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 241 states have internal predecessors, (270), 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-28 05:41:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2021-12-28 05:41:29,646 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2021-12-28 05:41:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:29,646 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2021-12-28 05:41:29,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-28 05:41:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2021-12-28 05:41:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 05:41:29,647 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:29,647 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:29,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 05:41:29,647 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2021-12-28 05:41:29,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:29,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279492603] [2021-12-28 05:41:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:41:29,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:29,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279492603] [2021-12-28 05:41:29,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279492603] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:29,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96785540] [2021-12-28 05:41:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:29,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:29,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:29,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 05:41:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:29,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 05:41:29,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:29,844 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 17 [2021-12-28 05:41:29,845 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 21 treesize of output 13 [2021-12-28 05:41:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:41:29,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:41:29,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96785540] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:29,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:29,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-12-28 05:41:29,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503635225] [2021-12-28 05:41:29,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:29,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:41:29,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:29,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:41:29,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:29,944 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-28 05:41:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:30,018 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2021-12-28 05:41:30,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 45 [2021-12-28 05:41:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:30,019 INFO L225 Difference]: With dead ends: 283 [2021-12-28 05:41:30,019 INFO L226 Difference]: Without dead ends: 275 [2021-12-28 05:41:30,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:30,020 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:30,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 349 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-28 05:41:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2021-12-28 05:41:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 268 states have internal predecessors, (304), 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-28 05:41:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2021-12-28 05:41:30,028 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2021-12-28 05:41:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:30,028 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2021-12-28 05:41:30,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-28 05:41:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2021-12-28 05:41:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 05:41:30,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:30,029 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:30,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:30,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:30,229 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2021-12-28 05:41:30,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:30,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430101809] [2021-12-28 05:41:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:30,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:30,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:30,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430101809] [2021-12-28 05:41:30,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430101809] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:30,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746956976] [2021-12-28 05:41:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:30,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:30,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:30,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-28 05:41:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:30,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-28 05:41:30,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:30,584 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-28 05:41:30,641 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:30,641 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-28 05:41:30,672 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 11 treesize of output 7 [2021-12-28 05:41:30,784 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:30,784 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 30 treesize of output 28 [2021-12-28 05:41:30,815 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:30,815 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 30 treesize of output 28 [2021-12-28 05:41:30,884 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:30,884 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-28 05:41:30,914 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:41:30,914 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 1 case distinctions, treesize of input 35 treesize of output 26 [2021-12-28 05:41:31,023 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-28 05:41:31,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2021-12-28 05:41:31,040 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 12 treesize of output 8 [2021-12-28 05:41:31,133 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-28 05:41:31,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2021-12-28 05:41:31,145 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 16 treesize of output 12 [2021-12-28 05:41:31,236 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 24 treesize of output 12 [2021-12-28 05:41:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:31,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:31,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:31,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:31,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:31,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-28 05:41:31,410 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:31,411 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:41:31,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2021-12-28 05:41:31,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2021-12-28 05:41:31,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_68| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_68|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2021-12-28 05:41:31,464 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:31,464 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 24 treesize of output 25 [2021-12-28 05:41:31,470 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:31,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 76 [2021-12-28 05:41:31,489 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:31,489 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 69 treesize of output 65 [2021-12-28 05:41:31,494 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 50 treesize of output 46 [2021-12-28 05:41:31,500 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 05:41:31,501 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 13 treesize of output 12 [2021-12-28 05:41:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-28 05:41:31,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746956976] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:31,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:31,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2021-12-28 05:41:31,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418035686] [2021-12-28 05:41:31,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:31,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-28 05:41:31,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:31,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-28 05:41:31,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=925, Unknown=7, NotChecked=476, Total=1560 [2021-12-28 05:41:31,673 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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-28 05:41:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:32,639 INFO L93 Difference]: Finished difference Result 335 states and 376 transitions. [2021-12-28 05:41:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 05:41:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 45 [2021-12-28 05:41:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:32,641 INFO L225 Difference]: With dead ends: 335 [2021-12-28 05:41:32,641 INFO L226 Difference]: Without dead ends: 335 [2021-12-28 05:41:32,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1897, Unknown=7, NotChecked=686, Total=2970 [2021-12-28 05:41:32,642 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 175 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1014 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:32,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 2078 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 862 Invalid, 0 Unknown, 1014 Unchecked, 0.4s Time] [2021-12-28 05:41:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-12-28 05:41:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 292. [2021-12-28 05:41:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 291 states have internal predecessors, (328), 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-28 05:41:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2021-12-28 05:41:32,646 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 45 [2021-12-28 05:41:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:32,646 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2021-12-28 05:41:32,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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-28 05:41:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2021-12-28 05:41:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 05:41:32,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:32,646 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:32,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-28 05:41:32,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-28 05:41:32,863 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2021-12-28 05:41:32,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:32,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195863213] [2021-12-28 05:41:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:32,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:32,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195863213] [2021-12-28 05:41:32,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195863213] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114083745] [2021-12-28 05:41:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:32,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:32,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:32,977 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:41:32,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-28 05:41:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:33,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-28 05:41:33,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:33,077 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-28 05:41:33,124 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:33,124 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-28 05:41:33,153 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 11 treesize of output 7 [2021-12-28 05:41:33,158 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 11 treesize of output 7 [2021-12-28 05:41:33,189 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 16 treesize of output 8 [2021-12-28 05:41:33,222 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 14 treesize of output 16 [2021-12-28 05:41:33,235 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 14 treesize of output 16 [2021-12-28 05:41:33,357 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 15 treesize of output 7 [2021-12-28 05:41:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:33,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:33,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2021-12-28 05:41:33,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:33,437 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 18 treesize of output 19 [2021-12-28 05:41:33,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:33,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-28 05:41:33,461 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 9 treesize of output 7 [2021-12-28 05:41:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:33,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114083745] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:33,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:33,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2021-12-28 05:41:33,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542342179] [2021-12-28 05:41:33,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:33,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-28 05:41:33,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-28 05:41:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2021-12-28 05:41:33,520 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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-28 05:41:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:33,883 INFO L93 Difference]: Finished difference Result 303 states and 334 transitions. [2021-12-28 05:41:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 05:41:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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 46 [2021-12-28 05:41:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:33,885 INFO L225 Difference]: With dead ends: 303 [2021-12-28 05:41:33,885 INFO L226 Difference]: Without dead ends: 303 [2021-12-28 05:41:33,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=824, Unknown=4, NotChecked=192, Total=1260 [2021-12-28 05:41:33,885 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 421 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:33,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 824 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 536 Invalid, 0 Unknown, 540 Unchecked, 0.2s Time] [2021-12-28 05:41:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-28 05:41:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 294. [2021-12-28 05:41:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.2595419847328244) internal successors, (330), 293 states have internal predecessors, (330), 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-28 05:41:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2021-12-28 05:41:33,889 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 46 [2021-12-28 05:41:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:33,889 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2021-12-28 05:41:33,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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-28 05:41:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2021-12-28 05:41:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-28 05:41:33,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:33,890 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:33,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:34,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-28 05:41:34,100 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2021-12-28 05:41:34,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:34,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765756484] [2021-12-28 05:41:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:34,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:34,121 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2021-12-28 05:41:34,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-28 05:41:34,128 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-28 05:41:34,146 INFO L158 Benchmark]: Toolchain (without parser) took 24623.51ms. Allocated memory was 54.5MB in the beginning and 144.7MB in the end (delta: 90.2MB). Free memory was 30.8MB in the beginning and 47.3MB in the end (delta: -16.5MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2021-12-28 05:41:34,146 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:41:34,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.31ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.6MB in the beginning and 42.3MB in the end (delta: -11.7MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2021-12-28 05:41:34,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 67.1MB. Free memory was 42.3MB in the beginning and 40.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:41:34,147 INFO L158 Benchmark]: Boogie Preprocessor took 53.61ms. Allocated memory is still 67.1MB. Free memory was 40.0MB in the beginning and 38.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 05:41:34,147 INFO L158 Benchmark]: RCFGBuilder took 548.85ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 45.9MB in the end (delta: -8.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-28 05:41:34,147 INFO L158 Benchmark]: TraceAbstraction took 23621.42ms. Allocated memory was 67.1MB in the beginning and 144.7MB in the end (delta: 77.6MB). Free memory was 45.3MB in the beginning and 47.3MB in the end (delta: -2.0MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:34,148 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.31ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.6MB in the beginning and 42.3MB in the end (delta: -11.7MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 67.1MB. Free memory was 42.3MB in the beginning and 40.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.61ms. Allocated memory is still 67.1MB. Free memory was 40.0MB in the beginning and 38.0MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 548.85ms. Allocated memory is still 67.1MB. Free memory was 37.8MB in the beginning and 45.9MB in the end (delta: -8.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23621.42ms. Allocated memory was 67.1MB in the beginning and 144.7MB in the end (delta: 77.6MB). Free memory was 45.3MB in the beginning and 47.3MB in the end (delta: -2.0MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-28 05:41:34,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 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/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:41:35,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:41:35,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:41:35,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:41:35,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:41:35,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:41:35,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:41:35,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:41:35,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:41:35,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:41:35,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:41:35,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:41:35,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:41:35,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:41:35,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:41:35,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:41:35,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:41:35,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:41:35,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:41:35,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:41:35,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:41:35,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:41:35,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:41:35,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:41:35,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:41:35,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:41:35,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:41:35,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:41:35,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:41:35,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:41:35,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:41:35,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:41:35,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:41:35,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:41:35,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:41:35,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:41:35,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:41:35,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:41:35,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:41:35,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:41:35,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:41:35,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2021-12-28 05:41:35,697 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:41:35,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:41:35,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:41:35,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:41:35,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:41:35,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:41:35,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:41:35,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:41:35,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:41:35,700 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:41:35,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:41:35,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:35,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:41:35,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:41:35,702 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 05:41:35,702 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 05:41:35,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 05:41:35,702 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2021-12-28 05:41:35,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:41:35,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:41:35,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:41:35,946 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:41:35,947 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:41:35,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-28 05:41:35,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fd513f1/9a9246e1c29f46e2962e92f35168a7d5/FLAG20c378f81 [2021-12-28 05:41:36,444 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:41:36,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-28 05:41:36,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fd513f1/9a9246e1c29f46e2962e92f35168a7d5/FLAG20c378f81 [2021-12-28 05:41:36,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fd513f1/9a9246e1c29f46e2962e92f35168a7d5 [2021-12-28 05:41:36,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:41:36,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:41:36,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:36,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:41:36,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:41:36,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:36" (1/1) ... [2021-12-28 05:41:36,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a001542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:36, skipping insertion in model container [2021-12-28 05:41:36,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:36" (1/1) ... [2021-12-28 05:41:36,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:41:36,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:41:37,116 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/forester-heap/sll-queue-2.i[22387,22400] [2021-12-28 05:41:37,119 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/forester-heap/sll-queue-2.i[22458,22471] [2021-12-28 05:41:37,120 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/forester-heap/sll-queue-2.i[22532,22545] [2021-12-28 05:41:37,121 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/forester-heap/sll-queue-2.i[22624,22637] [2021-12-28 05:41:37,122 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/forester-heap/sll-queue-2.i[22701,22714] [2021-12-28 05:41:37,123 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/forester-heap/sll-queue-2.i[22796,22809] [2021-12-28 05:41:37,124 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/forester-heap/sll-queue-2.i[22873,22886] [2021-12-28 05:41:37,125 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/forester-heap/sll-queue-2.i[22956,22969] [2021-12-28 05:41:37,126 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/forester-heap/sll-queue-2.i[23051,23064] [2021-12-28 05:41:37,127 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/forester-heap/sll-queue-2.i[23128,23141] [2021-12-28 05:41:37,131 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/forester-heap/sll-queue-2.i[23211,23224] [2021-12-28 05:41:37,131 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/forester-heap/sll-queue-2.i[23300,23313] [2021-12-28 05:41:37,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2021-12-28 05:41:37,134 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/forester-heap/sll-queue-2.i[23532,23545] [2021-12-28 05:41:37,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:37,152 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:41:37,181 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/forester-heap/sll-queue-2.i[22387,22400] [2021-12-28 05:41:37,182 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/forester-heap/sll-queue-2.i[22458,22471] [2021-12-28 05:41:37,182 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/forester-heap/sll-queue-2.i[22532,22545] [2021-12-28 05:41:37,182 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/forester-heap/sll-queue-2.i[22624,22637] [2021-12-28 05:41:37,183 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/forester-heap/sll-queue-2.i[22701,22714] [2021-12-28 05:41:37,184 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/forester-heap/sll-queue-2.i[22796,22809] [2021-12-28 05:41:37,184 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/forester-heap/sll-queue-2.i[22873,22886] [2021-12-28 05:41:37,185 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/forester-heap/sll-queue-2.i[22956,22969] [2021-12-28 05:41:37,186 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/forester-heap/sll-queue-2.i[23051,23064] [2021-12-28 05:41:37,188 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/forester-heap/sll-queue-2.i[23128,23141] [2021-12-28 05:41:37,189 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/forester-heap/sll-queue-2.i[23211,23224] [2021-12-28 05:41:37,190 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/forester-heap/sll-queue-2.i[23300,23313] [2021-12-28 05:41:37,190 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/forester-heap/sll-queue-2.i[23386,23399] [2021-12-28 05:41:37,191 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/forester-heap/sll-queue-2.i[23532,23545] [2021-12-28 05:41:37,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:37,221 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:41:37,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37 WrapperNode [2021-12-28 05:41:37,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:37,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:37,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:41:37,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:41:37,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,282 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-28 05:41:37,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:37,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:37,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:37,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:37,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:37,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:37,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:37,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:37,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (1/1) ... [2021-12-28 05:41:37,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:37,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:37,381 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-28 05:41:37,383 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-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 05:41:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:37,534 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:37,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:37,989 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:37,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:37,994 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-12-28 05:41:37,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:37 BoogieIcfgContainer [2021-12-28 05:41:37,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:37,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:37,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:38,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:38,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:41:36" (1/3) ... [2021-12-28 05:41:38,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5b316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:38, skipping insertion in model container [2021-12-28 05:41:38,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:37" (2/3) ... [2021-12-28 05:41:38,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f5b316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:38, skipping insertion in model container [2021-12-28 05:41:38,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:37" (3/3) ... [2021-12-28 05:41:38,002 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2021-12-28 05:41:38,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:38,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-12-28 05:41:38,038 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:38,042 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-28 05:41:38,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-12-28 05:41:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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-28 05:41:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:38,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:38,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:38,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:41:38,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:38,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521670415] [2021-12-28 05:41:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:38,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:38,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:38,077 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-28 05:41:38,112 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-28 05:41:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:38,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:41:38,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:38,250 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-28 05:41:38,270 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-28 05:41:38,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:38,271 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:38,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521670415] [2021-12-28 05:41:38,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521670415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:38,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:38,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:38,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895702329] [2021-12-28 05:41:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:38,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:38,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:38,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:38,300 INFO L87 Difference]: Start difference. First operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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) 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-28 05:41:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:38,531 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2021-12-28 05:41:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:38,534 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-28 05:41:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:38,546 INFO L225 Difference]: With dead ends: 166 [2021-12-28 05:41:38,546 INFO L226 Difference]: Without dead ends: 162 [2021-12-28 05:41:38,548 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-28 05:41:38,555 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 156 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:38,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-28 05:41:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-12-28 05:41:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 157 states have internal predecessors, (169), 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-28 05:41:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2021-12-28 05:41:38,599 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2021-12-28 05:41:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:38,599 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2021-12-28 05:41:38,600 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-28 05:41:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2021-12-28 05:41:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:38,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:38,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:38,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:38,806 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-28 05:41:38,807 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:41:38,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978288327] [2021-12-28 05:41:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:38,808 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:38,810 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-28 05:41:38,811 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-28 05:41:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:38,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:41:38,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:38,875 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-28 05:41:38,886 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-28 05:41:38,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:38,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:38,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978288327] [2021-12-28 05:41:38,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978288327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:38,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:38,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:38,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022305790] [2021-12-28 05:41:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:38,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:38,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:38,891 INFO L87 Difference]: Start difference. First operand 158 states and 169 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-28 05:41:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:39,045 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2021-12-28 05:41:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:39,046 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-28 05:41:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:39,046 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:41:39,046 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:41:39,047 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-28 05:41:39,047 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:39,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:39,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:41:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2021-12-28 05:41:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 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-28 05:41:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2021-12-28 05:41:39,055 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2021-12-28 05:41:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:39,055 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2021-12-28 05:41:39,055 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-28 05:41:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2021-12-28 05:41:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 05:41:39,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:39,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:39,065 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-28 05:41:39,262 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-28 05:41:39,262 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-28 05:41:39,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:39,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815051837] [2021-12-28 05:41:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:39,263 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:39,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:39,264 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-28 05:41:39,266 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-28 05:41:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:39,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:41:39,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:39,320 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-28 05:41:39,357 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 05:41:39,357 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-28 05:41:39,369 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-28 05:41:39,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:39,370 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:39,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815051837] [2021-12-28 05:41:39,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815051837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:39,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:39,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:39,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972247520] [2021-12-28 05:41:39,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:39,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:39,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:39,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:39,372 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:39,570 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2021-12-28 05:41:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-28 05:41:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:39,572 INFO L225 Difference]: With dead ends: 158 [2021-12-28 05:41:39,572 INFO L226 Difference]: Without dead ends: 158 [2021-12-28 05:41:39,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:39,573 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:39,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-28 05:41:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2021-12-28 05:41:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 149 states have internal predecessors, (164), 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-28 05:41:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2021-12-28 05:41:39,578 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2021-12-28 05:41:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:39,578 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2021-12-28 05:41:39,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2021-12-28 05:41:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 05:41:39,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:39,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:39,587 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-28 05:41:39,779 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-28 05:41:39,779 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:39,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-28 05:41:39,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:39,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180131870] [2021-12-28 05:41:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:39,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:39,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:39,782 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-28 05:41:39,783 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-28 05:41:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:39,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:41:39,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:39,878 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-28 05:41:39,932 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:39,932 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 14 [2021-12-28 05:41:39,942 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-28 05:41:39,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:39,942 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:39,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180131870] [2021-12-28 05:41:39,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180131870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:39,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:39,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:39,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684400098] [2021-12-28 05:41:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:39,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:39,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:39,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:39,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:39,944 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:40,214 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2021-12-28 05:41:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:40,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-28 05:41:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:40,216 INFO L225 Difference]: With dead ends: 240 [2021-12-28 05:41:40,216 INFO L226 Difference]: Without dead ends: 240 [2021-12-28 05:41:40,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:40,217 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:40,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:41:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-28 05:41:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2021-12-28 05:41:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 153 states have internal predecessors, (168), 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-28 05:41:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2021-12-28 05:41:40,223 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2021-12-28 05:41:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:40,223 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2021-12-28 05:41:40,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2021-12-28 05:41:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:41:40,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:40,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:40,230 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-28 05:41:40,430 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-28 05:41:40,430 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2021-12-28 05:41:40,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:40,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069168890] [2021-12-28 05:41:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:40,431 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:40,432 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-28 05:41:40,433 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-28 05:41:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:40,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:41:40,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:40,492 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-28 05:41:40,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:40,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:40,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069168890] [2021-12-28 05:41:40,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069168890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:40,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:40,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:40,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650323954] [2021-12-28 05:41:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:40,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:40,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:40,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:40,494 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:40,536 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2021-12-28 05:41:40,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:40,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-28 05:41:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:40,537 INFO L225 Difference]: With dead ends: 144 [2021-12-28 05:41:40,537 INFO L226 Difference]: Without dead ends: 144 [2021-12-28 05:41:40,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:40,538 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:40,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-28 05:41:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-12-28 05:41:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 143 states have internal predecessors, (157), 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-28 05:41:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2021-12-28 05:41:40,542 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2021-12-28 05:41:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:40,542 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2021-12-28 05:41:40,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2021-12-28 05:41:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:41:40,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:40,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:40,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-28 05:41:40,748 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-28 05:41:40,748 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-28 05:41:40,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:40,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984371743] [2021-12-28 05:41:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:40,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:40,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:40,750 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-28 05:41:40,752 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-28 05:41:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:40,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:41:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:40,826 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-28 05:41:40,840 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 11 treesize of output 7 [2021-12-28 05:41:40,852 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 17 treesize of output 9 [2021-12-28 05:41:40,862 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-28 05:41:40,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:40,863 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:40,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984371743] [2021-12-28 05:41:40,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984371743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:40,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:40,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:40,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239439833] [2021-12-28 05:41:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:40,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:40,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:40,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:40,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:40,864 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-28 05:41:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:41,190 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2021-12-28 05:41:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:41:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:41:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:41,191 INFO L225 Difference]: With dead ends: 215 [2021-12-28 05:41:41,191 INFO L226 Difference]: Without dead ends: 215 [2021-12-28 05:41:41,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:41,192 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:41,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 656 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:41:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-28 05:41:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2021-12-28 05:41:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.5) internal successors, (156), 142 states have internal predecessors, (156), 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-28 05:41:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2021-12-28 05:41:41,195 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2021-12-28 05:41:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:41,196 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2021-12-28 05:41:41,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-28 05:41:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2021-12-28 05:41:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:41:41,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:41,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:41,204 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-28 05:41:41,402 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-28 05:41:41,403 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-28 05:41:41,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:41,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734690863] [2021-12-28 05:41:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:41,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:41,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:41,405 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-28 05:41:41,406 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-28 05:41:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:41,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 05:41:41,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:41,472 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-28 05:41:41,496 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 11 treesize of output 7 [2021-12-28 05:41:41,510 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 11 treesize of output 7 [2021-12-28 05:41:41,537 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 17 treesize of output 9 [2021-12-28 05:41:41,544 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 15 treesize of output 7 [2021-12-28 05:41:41,568 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-28 05:41:41,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:41,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:41,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734690863] [2021-12-28 05:41:41,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734690863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:41,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:41,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:41,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956996233] [2021-12-28 05:41:41,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:41,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:41,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:41,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:41,570 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-28 05:41:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:41,977 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2021-12-28 05:41:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:41:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:41:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:41,978 INFO L225 Difference]: With dead ends: 207 [2021-12-28 05:41:41,978 INFO L226 Difference]: Without dead ends: 207 [2021-12-28 05:41:41,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:41,979 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 96 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:41,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:41:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-28 05:41:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2021-12-28 05:41:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 132 states have internal predecessors, (145), 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-28 05:41:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-28 05:41:41,982 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2021-12-28 05:41:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:41,982 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-28 05:41:41,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-28 05:41:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-28 05:41:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:41:41,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:41,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:41,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-28 05:41:42,188 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-28 05:41:42,189 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2021-12-28 05:41:42,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993800002] [2021-12-28 05:41:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:42,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:42,191 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-28 05:41:42,192 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-28 05:41:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:42,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:41:42,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:42,255 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-28 05:41:42,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:42,256 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:42,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993800002] [2021-12-28 05:41:42,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993800002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:42,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:42,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:42,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629881814] [2021-12-28 05:41:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:42,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:42,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:42,257 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-28 05:41:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:42,276 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2021-12-28 05:41:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:42,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-12-28 05:41:42,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:42,277 INFO L225 Difference]: With dead ends: 185 [2021-12-28 05:41:42,277 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 05:41:42,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-28 05:41:42,278 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:42,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 05:41:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2021-12-28 05:41:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 144 states have internal predecessors, (158), 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-28 05:41:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2021-12-28 05:41:42,283 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2021-12-28 05:41:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:42,284 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2021-12-28 05:41:42,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-28 05:41:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2021-12-28 05:41:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:41:42,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:42,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:42,292 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-28 05:41:42,491 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-28 05:41:42,492 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:42,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2021-12-28 05:41:42,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155594236] [2021-12-28 05:41:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:42,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:42,494 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-28 05:41:42,499 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-28 05:41:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:42,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:41:42,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:42,576 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-28 05:41:42,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:42,577 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:42,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155594236] [2021-12-28 05:41:42,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155594236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:42,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:42,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:42,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060029772] [2021-12-28 05:41:42,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:42,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:42,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:42,583 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-28 05:41:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:42,613 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2021-12-28 05:41:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:42,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-12-28 05:41:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:42,614 INFO L225 Difference]: With dead ends: 176 [2021-12-28 05:41:42,614 INFO L226 Difference]: Without dead ends: 176 [2021-12-28 05:41:42,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:42,615 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:42,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-28 05:41:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2021-12-28 05:41:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.396694214876033) internal successors, (169), 153 states have internal predecessors, (169), 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-28 05:41:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2021-12-28 05:41:42,618 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2021-12-28 05:41:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:42,618 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2021-12-28 05:41:42,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-28 05:41:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2021-12-28 05:41:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:41:42,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:42,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:42,625 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-28 05:41:42,823 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-28 05:41:42,823 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2021-12-28 05:41:42,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:42,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887721995] [2021-12-28 05:41:42,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:42,824 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:42,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:42,825 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-28 05:41:42,827 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-28 05:41:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:42,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:41:42,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:42,907 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 11 treesize of output 7 [2021-12-28 05:41:42,922 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 16 treesize of output 8 [2021-12-28 05:41:42,948 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-28 05:41:42,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:42,949 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887721995] [2021-12-28 05:41:42,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887721995] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:42,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:42,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:41:42,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110350001] [2021-12-28 05:41:42,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:42,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:42,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:42,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:42,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:42,950 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:43,125 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2021-12-28 05:41:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:41:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-28 05:41:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:43,126 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:41:43,126 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:41:43,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:41:43,127 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:43,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:41:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-28 05:41:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 151 states have internal predecessors, (167), 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-28 05:41:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2021-12-28 05:41:43,129 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2021-12-28 05:41:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:43,129 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2021-12-28 05:41:43,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:41:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2021-12-28 05:41:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:41:43,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:43,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:43,137 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-28 05:41:43,336 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-28 05:41:43,337 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2021-12-28 05:41:43,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:43,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799405771] [2021-12-28 05:41:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:43,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:43,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:43,338 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-28 05:41:43,339 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-28 05:41:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:43,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 05:41:43,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:43,495 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-28 05:41:43,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:43,495 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:43,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799405771] [2021-12-28 05:41:43,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799405771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:43,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:43,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:43,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656039006] [2021-12-28 05:41:43,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:43,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:43,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:43,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:43,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:43,496 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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-28 05:41:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:43,639 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-12-28 05:41:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:43,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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 19 [2021-12-28 05:41:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:43,640 INFO L225 Difference]: With dead ends: 156 [2021-12-28 05:41:43,640 INFO L226 Difference]: Without dead ends: 156 [2021-12-28 05:41:43,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:43,640 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:43,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-28 05:41:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2021-12-28 05:41:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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-28 05:41:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-12-28 05:41:43,643 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2021-12-28 05:41:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:43,643 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-12-28 05:41:43,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 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-28 05:41:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-12-28 05:41:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-28 05:41:43,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:43,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:43,652 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-28 05:41:43,844 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-28 05:41:43,844 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2021-12-28 05:41:43,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:43,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042436134] [2021-12-28 05:41:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:43,845 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:43,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:43,846 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-28 05:41:43,846 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-28 05:41:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:43,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 05:41:43,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:43,911 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 11 treesize of output 7 [2021-12-28 05:41:43,916 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 11 treesize of output 7 [2021-12-28 05:41:43,941 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:41:43,941 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 21 treesize of output 20 [2021-12-28 05:41:43,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:43,947 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 20 [2021-12-28 05:41:43,998 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 15 treesize of output 7 [2021-12-28 05:41:44,000 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 15 treesize of output 7 [2021-12-28 05:41:44,026 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-28 05:41:44,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:44,026 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042436134] [2021-12-28 05:41:44,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042436134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:44,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:44,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:44,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250999958] [2021-12-28 05:41:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:44,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:44,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:44,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:44,028 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 05:41:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:44,172 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2021-12-28 05:41:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2021-12-28 05:41:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:44,173 INFO L225 Difference]: With dead ends: 149 [2021-12-28 05:41:44,173 INFO L226 Difference]: Without dead ends: 149 [2021-12-28 05:41:44,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:44,174 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:44,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-28 05:41:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-12-28 05:41:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 145 states have internal predecessors, (157), 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-28 05:41:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2021-12-28 05:41:44,177 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2021-12-28 05:41:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:44,177 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2021-12-28 05:41:44,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-28 05:41:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2021-12-28 05:41:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:41:44,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:44,178 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:44,186 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-28 05:41:44,383 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-28 05:41:44,384 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2021-12-28 05:41:44,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:44,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936193013] [2021-12-28 05:41:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:44,384 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:44,385 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-28 05:41:44,387 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-28 05:41:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:44,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 05:41:44,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:44,452 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 11 treesize of output 7 [2021-12-28 05:41:44,455 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 11 treesize of output 7 [2021-12-28 05:41:44,477 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:41:44,478 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 21 treesize of output 20 [2021-12-28 05:41:44,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:44,482 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 20 [2021-12-28 05:41:44,542 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 15 treesize of output 7 [2021-12-28 05:41:44,544 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 15 treesize of output 7 [2021-12-28 05:41:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:44,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:44,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:44,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936193013] [2021-12-28 05:41:44,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936193013] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:44,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:41:44,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-12-28 05:41:44,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509173835] [2021-12-28 05:41:44,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:44,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:44,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:44,675 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:41:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:44,789 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-28 05:41:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-12-28 05:41:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:44,790 INFO L225 Difference]: With dead ends: 153 [2021-12-28 05:41:44,790 INFO L226 Difference]: Without dead ends: 153 [2021-12-28 05:41:44,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:44,791 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:44,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-28 05:41:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-28 05:41:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 152 states have internal predecessors, (164), 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-28 05:41:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2021-12-28 05:41:44,794 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2021-12-28 05:41:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:44,794 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2021-12-28 05:41:44,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:41:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2021-12-28 05:41:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:41:44,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:44,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:44,802 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-28 05:41:45,002 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-28 05:41:45,003 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2021-12-28 05:41:45,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:45,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256947493] [2021-12-28 05:41:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:45,003 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:45,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:45,004 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-28 05:41:45,005 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-28 05:41:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:45,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:41:45,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:45,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:45,269 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256947493] [2021-12-28 05:41:45,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256947493] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:45,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:41:45,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-28 05:41:45,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003104614] [2021-12-28 05:41:45,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:45,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:41:45,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:41:45,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:41:45,271 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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-28 05:41:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:45,503 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2021-12-28 05:41:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23 [2021-12-28 05:41:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:45,504 INFO L225 Difference]: With dead ends: 155 [2021-12-28 05:41:45,504 INFO L226 Difference]: Without dead ends: 138 [2021-12-28 05:41:45,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:45,504 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:45,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-28 05:41:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-28 05:41:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-12-28 05:41:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 137 states have internal predecessors, (148), 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-28 05:41:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2021-12-28 05:41:45,507 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2021-12-28 05:41:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:45,507 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2021-12-28 05:41:45,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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-28 05:41:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2021-12-28 05:41:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:41:45,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:45,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:45,514 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-28 05:41:45,708 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-28 05:41:45,708 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2021-12-28 05:41:45,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:45,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459267180] [2021-12-28 05:41:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:45,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:45,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:45,710 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-28 05:41:45,712 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-28 05:41:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:45,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 05:41:45,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:45,798 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-28 05:41:45,832 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:45,832 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-28 05:41:45,860 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 11 treesize of output 7 [2021-12-28 05:41:45,938 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:45,938 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 30 treesize of output 28 [2021-12-28 05:41:45,962 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:45,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 27 treesize of output 28 [2021-12-28 05:41:46,027 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 24 treesize of output 12 [2021-12-28 05:41:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:46,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:46,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-28 05:41:46,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-28 05:41:46,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-28 05:41:46,118 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:46,119 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 19 treesize of output 20 [2021-12-28 05:41:46,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:46,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-28 05:41:46,132 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 20 treesize of output 18 [2021-12-28 05:41:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:46,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:46,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459267180] [2021-12-28 05:41:46,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459267180] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:46,224 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:41:46,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-12-28 05:41:46,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43850277] [2021-12-28 05:41:46,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:46,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 05:41:46,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:46,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 05:41:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2021-12-28 05:41:46,226 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-28 05:41:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:46,844 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2021-12-28 05:41:46,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:41:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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 27 [2021-12-28 05:41:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:46,846 INFO L225 Difference]: With dead ends: 238 [2021-12-28 05:41:46,846 INFO L226 Difference]: Without dead ends: 238 [2021-12-28 05:41:46,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2021-12-28 05:41:46,846 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:46,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 614 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 454 Unchecked, 0.4s Time] [2021-12-28 05:41:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-28 05:41:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2021-12-28 05:41:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 151 states have internal predecessors, (164), 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-28 05:41:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2021-12-28 05:41:46,849 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2021-12-28 05:41:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:46,849 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2021-12-28 05:41:46,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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-28 05:41:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2021-12-28 05:41:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:41:46,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:46,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:46,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:47,057 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-28 05:41:47,057 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2021-12-28 05:41:47,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:47,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386684674] [2021-12-28 05:41:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:47,058 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:47,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:47,059 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-28 05:41:47,061 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-28 05:41:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:47,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:41:47,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:47,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:47,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:47,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386684674] [2021-12-28 05:41:47,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386684674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:47,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:47,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:47,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604309151] [2021-12-28 05:41:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:47,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:47,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:47,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:47,168 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-28 05:41:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:47,188 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2021-12-28 05:41:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:47,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2021-12-28 05:41:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:47,189 INFO L225 Difference]: With dead ends: 209 [2021-12-28 05:41:47,189 INFO L226 Difference]: Without dead ends: 209 [2021-12-28 05:41:47,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-28 05:41:47,190 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:47,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 236 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-28 05:41:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2021-12-28 05:41:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 168 states have internal predecessors, (181), 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-28 05:41:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2021-12-28 05:41:47,193 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2021-12-28 05:41:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:47,193 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2021-12-28 05:41:47,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-28 05:41:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2021-12-28 05:41:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:41:47,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:47,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:47,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:47,400 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-28 05:41:47,401 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2021-12-28 05:41:47,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:47,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306662803] [2021-12-28 05:41:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:47,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:47,404 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-28 05:41:47,407 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-28 05:41:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:47,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-28 05:41:47,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:47,519 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-28 05:41:47,553 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:41:47,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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-28 05:41:47,586 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 11 treesize of output 7 [2021-12-28 05:41:47,673 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:47,673 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 31 treesize of output 29 [2021-12-28 05:41:47,702 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:47,702 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 28 treesize of output 29 [2021-12-28 05:41:47,838 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 13 [2021-12-28 05:41:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:47,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:47,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:41:47,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:41:47,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:41:47,999 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:47,999 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 20 treesize of output 21 [2021-12-28 05:41:48,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:48,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-28 05:41:48,010 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-28 05:41:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:56,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306662803] [2021-12-28 05:41:56,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306662803] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:56,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:41:56,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-12-28 05:41:56,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728454788] [2021-12-28 05:41:56,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:56,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-28 05:41:56,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-28 05:41:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=206, Unknown=6, NotChecked=96, Total=380 [2021-12-28 05:41:56,730 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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-28 05:41:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:57,195 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2021-12-28 05:41:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:41:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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 35 [2021-12-28 05:41:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:57,196 INFO L225 Difference]: With dead ends: 216 [2021-12-28 05:41:57,196 INFO L226 Difference]: Without dead ends: 216 [2021-12-28 05:41:57,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=117, Invalid=309, Unknown=6, NotChecked=120, Total=552 [2021-12-28 05:41:57,197 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 244 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:57,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 1010 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 643 Unchecked, 0.3s Time] [2021-12-28 05:41:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-28 05:41:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2021-12-28 05:41:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 178 states have internal predecessors, (194), 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-28 05:41:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2021-12-28 05:41:57,200 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2021-12-28 05:41:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:57,200 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2021-12-28 05:41:57,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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-28 05:41:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2021-12-28 05:41:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:41:57,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:57,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:57,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-28 05:41:57,408 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-28 05:41:57,408 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:41:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2021-12-28 05:41:57,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348075724] [2021-12-28 05:41:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:57,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:57,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:57,410 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-28 05:41:57,448 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-28 05:41:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:57,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 05:41:57,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:57,532 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-28 05:41:57,587 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:57,588 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-28 05:41:57,597 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-28 05:41:57,620 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 11 treesize of output 7 [2021-12-28 05:41:57,627 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 11 treesize of output 7 [2021-12-28 05:41:57,722 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:57,722 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 31 treesize of output 29 [2021-12-28 05:41:57,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:57,732 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 14 treesize of output 16 [2021-12-28 05:41:57,759 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:57,759 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 38 treesize of output 37 [2021-12-28 05:41:57,763 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 18 treesize of output 20 [2021-12-28 05:41:57,897 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 13 [2021-12-28 05:41:57,901 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 15 treesize of output 7 [2021-12-28 05:41:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:57,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:58,274 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-28 05:41:58,320 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2021-12-28 05:41:58,344 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-28 05:41:58,370 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:58,370 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 37 treesize of output 30 [2021-12-28 05:41:58,387 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:58,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-28 05:41:58,393 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 15 treesize of output 11 [2021-12-28 05:41:58,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:58,431 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 37 treesize of output 38 [2021-12-28 05:41:58,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:58,441 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-28 05:41:58,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:58,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-28 05:41:58,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:58,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-28 05:41:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:58,595 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:58,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348075724] [2021-12-28 05:41:58,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348075724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:58,595 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:41:58,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-28 05:41:58,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513027804] [2021-12-28 05:41:58,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:58,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-28 05:41:58,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:58,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 05:41:58,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-28 05:41:58,599 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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-28 05:42:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:00,382 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2021-12-28 05:42:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 05:42:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 35 [2021-12-28 05:42:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:00,383 INFO L225 Difference]: With dead ends: 303 [2021-12-28 05:42:00,384 INFO L226 Difference]: Without dead ends: 303 [2021-12-28 05:42:00,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=610, Unknown=3, NotChecked=162, Total=930 [2021-12-28 05:42:00,384 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:00,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 636 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 711 Unchecked, 1.1s Time] [2021-12-28 05:42:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-28 05:42:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2021-12-28 05:42:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 182 states have internal predecessors, (198), 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-28 05:42:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2021-12-28 05:42:00,387 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2021-12-28 05:42:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:00,387 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2021-12-28 05:42:00,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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-28 05:42:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2021-12-28 05:42:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 05:42:00,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:00,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:00,402 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-28 05:42:00,595 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-28 05:42:00,595 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2021-12-28 05:42:00,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:00,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667300132] [2021-12-28 05:42:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:00,596 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:00,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:00,597 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-28 05:42:00,600 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-28 05:42:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:00,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 05:42:00,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:00,702 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-28 05:42:00,744 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:42:00,745 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-28 05:42:00,774 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 11 treesize of output 7 [2021-12-28 05:42:00,779 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 11 treesize of output 7 [2021-12-28 05:42:00,901 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:00,902 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 22 treesize of output 22 [2021-12-28 05:42:00,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:00,910 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 21 [2021-12-28 05:42:00,944 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:00,944 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 54 treesize of output 51 [2021-12-28 05:42:00,948 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 25 treesize of output 17 [2021-12-28 05:42:00,951 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 35 treesize of output 35 [2021-12-28 05:42:01,145 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 33 treesize of output 21 [2021-12-28 05:42:01,150 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 28 treesize of output 16 [2021-12-28 05:42:01,201 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 15 treesize of output 7 [2021-12-28 05:42:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:01,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:01,377 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 77 treesize of output 57 [2021-12-28 05:42:01,384 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:42:01,406 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.offset|)) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:42:01,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) is different from false [2021-12-28 05:42:01,429 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:01,429 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 18 treesize of output 19 [2021-12-28 05:42:01,436 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:01,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-28 05:42:01,440 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 9 treesize of output 7 [2021-12-28 05:42:01,461 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-28 05:42:01,462 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 18 treesize of output 1 [2021-12-28 05:42:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:01,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:01,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667300132] [2021-12-28 05:42:01,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667300132] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:01,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:42:01,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-28 05:42:01,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125488461] [2021-12-28 05:42:01,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:01,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-28 05:42:01,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:01,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-28 05:42:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2021-12-28 05:42:01,560 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-28 05:42:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:03,072 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2021-12-28 05:42:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 05:42:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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 38 [2021-12-28 05:42:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:03,074 INFO L225 Difference]: With dead ends: 301 [2021-12-28 05:42:03,074 INFO L226 Difference]: Without dead ends: 301 [2021-12-28 05:42:03,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=995, Unknown=4, NotChecked=204, Total=1406 [2021-12-28 05:42:03,075 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 403 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:03,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 1301 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 857 Invalid, 0 Unknown, 523 Unchecked, 1.0s Time] [2021-12-28 05:42:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-28 05:42:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2021-12-28 05:42:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 181 states have internal predecessors, (196), 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-28 05:42:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2021-12-28 05:42:03,078 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2021-12-28 05:42:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:03,079 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2021-12-28 05:42:03,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 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-28 05:42:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2021-12-28 05:42:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-28 05:42:03,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:03,079 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:03,088 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-28 05:42:03,286 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-28 05:42:03,287 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:03,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2021-12-28 05:42:03,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:03,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032221722] [2021-12-28 05:42:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:03,287 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:03,288 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-28 05:42:03,289 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-28 05:42:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:03,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-28 05:42:03,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:03,390 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-28 05:42:03,426 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:42:03,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 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-28 05:42:03,454 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 11 treesize of output 7 [2021-12-28 05:42:03,544 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:03,544 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 31 treesize of output 29 [2021-12-28 05:42:03,573 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:03,573 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 28 treesize of output 29 [2021-12-28 05:42:03,735 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 13 [2021-12-28 05:42:03,781 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 0 case distinctions, treesize of input 20 treesize of output 20 [2021-12-28 05:42:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:03,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:03,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:42:03,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv1 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:42:03,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:42:03,950 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:03,950 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 23 treesize of output 24 [2021-12-28 05:42:03,960 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:03,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2021-12-28 05:42:03,963 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 14 treesize of output 12 [2021-12-28 05:42:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:04,727 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:04,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032221722] [2021-12-28 05:42:04,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032221722] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:04,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:42:04,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-28 05:42:04,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984262528] [2021-12-28 05:42:04,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:04,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-28 05:42:04,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-28 05:42:04,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=244, Unknown=3, NotChecked=102, Total=420 [2021-12-28 05:42:04,728 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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-28 05:42:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:05,168 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2021-12-28 05:42:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:42:05,168 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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 40 [2021-12-28 05:42:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:05,169 INFO L225 Difference]: With dead ends: 218 [2021-12-28 05:42:05,169 INFO L226 Difference]: Without dead ends: 218 [2021-12-28 05:42:05,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=323, Unknown=3, NotChecked=120, Total=552 [2021-12-28 05:42:05,170 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:05,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 686 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 887 Unchecked, 0.3s Time] [2021-12-28 05:42:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-28 05:42:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2021-12-28 05:42:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 201 states have internal predecessors, (226), 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-28 05:42:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-12-28 05:42:05,172 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2021-12-28 05:42:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:05,172 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-12-28 05:42:05,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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-28 05:42:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-12-28 05:42:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-28 05:42:05,173 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:05,173 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:05,180 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-28 05:42:05,380 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-28 05:42:05,380 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2021-12-28 05:42:05,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:05,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122420185] [2021-12-28 05:42:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:05,381 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:05,382 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-28 05:42:05,383 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-28 05:42:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:05,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-28 05:42:05,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:05,500 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-28 05:42:05,530 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:42:05,530 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-28 05:42:05,536 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-28 05:42:05,563 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 11 treesize of output 7 [2021-12-28 05:42:05,569 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 11 treesize of output 7 [2021-12-28 05:42:05,667 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:05,668 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 31 treesize of output 29 [2021-12-28 05:42:05,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:42:05,676 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 14 treesize of output 16 [2021-12-28 05:42:05,705 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:05,705 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 38 treesize of output 37 [2021-12-28 05:42:05,708 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 18 treesize of output 20 [2021-12-28 05:42:05,875 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 13 [2021-12-28 05:42:05,878 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 15 treesize of output 7 [2021-12-28 05:42:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:05,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:06,265 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-28 05:42:06,308 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-28 05:42:06,329 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2021-12-28 05:42:06,348 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:06,348 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 37 treesize of output 38 [2021-12-28 05:42:06,353 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:06,353 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 29 treesize of output 30 [2021-12-28 05:42:06,364 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:06,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2021-12-28 05:42:06,378 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:06,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2021-12-28 05:42:06,401 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 34 treesize of output 30 [2021-12-28 05:42:06,406 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 62 treesize of output 58 [2021-12-28 05:42:06,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:06,818 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 35 treesize of output 28 [2021-12-28 05:42:06,828 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:06,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-28 05:42:06,834 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 13 treesize of output 9 [2021-12-28 05:42:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:07,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:07,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122420185] [2021-12-28 05:42:07,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122420185] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:07,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:42:07,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-28 05:42:07,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668742646] [2021-12-28 05:42:07,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:07,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-28 05:42:07,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 05:42:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-28 05:42:07,230 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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-28 05:42:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:08,332 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2021-12-28 05:42:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:42:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 40 [2021-12-28 05:42:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:08,334 INFO L225 Difference]: With dead ends: 217 [2021-12-28 05:42:08,334 INFO L226 Difference]: Without dead ends: 217 [2021-12-28 05:42:08,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2021-12-28 05:42:08,334 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:08,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 509 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 384 Invalid, 0 Unknown, 755 Unchecked, 0.7s Time] [2021-12-28 05:42:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-28 05:42:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2021-12-28 05:42:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 201 states have internal predecessors, (225), 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-28 05:42:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2021-12-28 05:42:08,337 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2021-12-28 05:42:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:08,337 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2021-12-28 05:42:08,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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-28 05:42:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2021-12-28 05:42:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-28 05:42:08,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:08,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:08,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-28 05:42:08,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:42:08,545 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:08,545 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2021-12-28 05:42:08,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:08,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399113428] [2021-12-28 05:42:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:08,546 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:08,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:08,547 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:42:08,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-28 05:42:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:08,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 05:42:08,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:08,714 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 17 [2021-12-28 05:42:08,716 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 21 treesize of output 13 [2021-12-28 05:42:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:42:08,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:42:08,851 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399113428] [2021-12-28 05:42:08,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399113428] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:08,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:42:08,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-28 05:42:08,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240981728] [2021-12-28 05:42:08,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:08,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:42:08,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:42:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:42:08,853 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-28 05:42:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:09,013 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2021-12-28 05:42:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:42:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 41 [2021-12-28 05:42:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:09,016 INFO L225 Difference]: With dead ends: 229 [2021-12-28 05:42:09,016 INFO L226 Difference]: Without dead ends: 229 [2021-12-28 05:42:09,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:42:09,017 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:09,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:42:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-28 05:42:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2021-12-28 05:42:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.324607329842932) internal successors, (253), 222 states have internal predecessors, (253), 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-28 05:42:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2021-12-28 05:42:09,027 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2021-12-28 05:42:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:09,027 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2021-12-28 05:42:09,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-28 05:42:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2021-12-28 05:42:09,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-28 05:42:09,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:09,027 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:09,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-28 05:42:09,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:42:09,232 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2021-12-28 05:42:09,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:09,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240933646] [2021-12-28 05:42:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:09,233 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:09,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:09,235 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:42:09,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-28 05:42:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:09,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:42:09,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 05:42:09,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:42:09,404 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:09,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240933646] [2021-12-28 05:42:09,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240933646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:09,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:09,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:42:09,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115397253] [2021-12-28 05:42:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:09,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:42:09,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:42:09,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:42:09,405 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-28 05:42:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:09,425 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2021-12-28 05:42:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:42:09,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 41 [2021-12-28 05:42:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:09,428 INFO L225 Difference]: With dead ends: 283 [2021-12-28 05:42:09,428 INFO L226 Difference]: Without dead ends: 283 [2021-12-28 05:42:09,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-28 05:42:09,432 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:09,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:42:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-28 05:42:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2021-12-28 05:42:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 240 states have internal predecessors, (272), 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-28 05:42:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2021-12-28 05:42:09,435 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2021-12-28 05:42:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:09,436 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2021-12-28 05:42:09,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-28 05:42:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2021-12-28 05:42:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:42:09,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:09,437 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:09,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-28 05:42:09,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:42:09,648 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:09,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2021-12-28 05:42:09,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:09,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965528710] [2021-12-28 05:42:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:09,649 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:09,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:09,650 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:42:09,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-28 05:42:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:09,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-28 05:42:09,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:09,753 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-28 05:42:09,781 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:42:09,781 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-28 05:42:09,805 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 11 treesize of output 7 [2021-12-28 05:42:09,812 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 11 treesize of output 7 [2021-12-28 05:42:09,842 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 16 treesize of output 8 [2021-12-28 05:42:09,873 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 14 treesize of output 16 [2021-12-28 05:42:09,886 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 14 treesize of output 16 [2021-12-28 05:42:09,936 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 15 treesize of output 7 [2021-12-28 05:42:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:09,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:10,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-28 05:42:10,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-28 05:42:10,043 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-28 05:42:10,052 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:10,052 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 18 treesize of output 19 [2021-12-28 05:42:10,060 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:10,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-28 05:42:10,063 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 9 treesize of output 7 [2021-12-28 05:42:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:10,140 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:10,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965528710] [2021-12-28 05:42:10,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965528710] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:10,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:42:10,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-12-28 05:42:10,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994891359] [2021-12-28 05:42:10,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:10,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-28 05:42:10,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:10,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-28 05:42:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2021-12-28 05:42:10,141 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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-28 05:42:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:10,872 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2021-12-28 05:42:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 05:42:10,872 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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 42 [2021-12-28 05:42:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:10,873 INFO L225 Difference]: With dead ends: 258 [2021-12-28 05:42:10,873 INFO L226 Difference]: Without dead ends: 258 [2021-12-28 05:42:10,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=493, Unknown=3, NotChecked=150, Total=812 [2021-12-28 05:42:10,873 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:10,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 899 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 547 Invalid, 0 Unknown, 451 Unchecked, 0.5s Time] [2021-12-28 05:42:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-28 05:42:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2021-12-28 05:42:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 242 states have internal predecessors, (274), 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-28 05:42:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2021-12-28 05:42:10,877 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2021-12-28 05:42:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:10,877 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2021-12-28 05:42:10,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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-28 05:42:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2021-12-28 05:42:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:42:10,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:10,877 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:10,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-28 05:42:11,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:42:11,085 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1471647316, now seen corresponding path program 1 times [2021-12-28 05:42:11,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:11,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788730500] [2021-12-28 05:42:11,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:11,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:11,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:11,086 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:42:11,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-28 05:42:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:11,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:42:11,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:11,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:42:11,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788730500] [2021-12-28 05:42:11,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788730500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:42:11,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:42:11,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:42:11,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901411114] [2021-12-28 05:42:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:42:11,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:42:11,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:42:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:42:11,230 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-28 05:42:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:42:11,266 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2021-12-28 05:42:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:42:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2021-12-28 05:42:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:42:11,267 INFO L225 Difference]: With dead ends: 256 [2021-12-28 05:42:11,267 INFO L226 Difference]: Without dead ends: 256 [2021-12-28 05:42:11,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:42:11,267 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:42:11,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:42:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-28 05:42:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2021-12-28 05:42:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.273170731707317) internal successors, (261), 236 states have internal predecessors, (261), 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-28 05:42:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2021-12-28 05:42:11,276 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 42 [2021-12-28 05:42:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:42:11,277 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2021-12-28 05:42:11,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-28 05:42:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2021-12-28 05:42:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:42:11,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:42:11,277 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:42:11,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-28 05:42:11,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:42:11,484 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-28 05:42:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:42:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1095816814, now seen corresponding path program 1 times [2021-12-28 05:42:11,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:42:11,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645639640] [2021-12-28 05:42:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:42:11,485 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:42:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:42:11,486 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:42:11,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-28 05:42:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:42:11,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:42:11,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:42:11,629 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-28 05:42:11,662 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:42:11,662 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-28 05:42:11,691 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 11 treesize of output 7 [2021-12-28 05:42:11,800 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:11,800 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 30 treesize of output 28 [2021-12-28 05:42:11,829 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:42:11,829 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 30 treesize of output 28 [2021-12-28 05:42:11,888 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:42:11,889 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-28 05:42:11,924 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-28 05:42:11,925 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 1 case distinctions, treesize of input 35 treesize of output 26 [2021-12-28 05:42:12,037 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-28 05:42:12,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2021-12-28 05:42:12,049 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 12 treesize of output 8 [2021-12-28 05:42:12,144 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-28 05:42:12,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2021-12-28 05:42:12,164 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 16 treesize of output 12 [2021-12-28 05:42:12,234 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 24 treesize of output 12 [2021-12-28 05:42:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:42:12,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:42:12,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-28 05:42:12,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-28 05:42:12,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:42:12,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-28 05:42:12,445 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:12,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:42:12,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2021-12-28 05:42:12,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2021-12-28 05:42:12,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.offset_75| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |v_ULTIMATE.start_main_~item~0#1.offset_75|))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2021-12-28 05:42:12,533 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:12,533 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 24 treesize of output 25 [2021-12-28 05:42:12,544 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:12,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 76 [2021-12-28 05:42:12,555 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:42:12,555 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 69 treesize of output 65 [2021-12-28 05:42:12,560 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 50 treesize of output 46 [2021-12-28 05:42:12,574 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-28 05:42:12,574 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 13 treesize of output 12 [2021-12-28 05:42:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-28 05:42:12,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:42:12,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645639640] [2021-12-28 05:42:12,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645639640] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:42:12,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:42:12,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2021-12-28 05:42:12,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610885115] [2021-12-28 05:42:12,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:42:12,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 05:42:12,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:42:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 05:42:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=277, Unknown=7, NotChecked=280, Total=650 [2021-12-28 05:42:12,740 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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)